#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll N=1E6+;

const ll mod=1e9+;

ll arr[N];

ll mp[N];

ll ksm(ll a,ll b){

    ll res=;

    while(b){

        if(b&) res=res*a%mod;

        a=a*a%mod;

        b>>=;

    }

    return res%mod;

}

int main()

{

    ios::sync_with_stdio(false );

    ll n;

    cin>>n;

    ll mx=;

    for(ll i=;i<=n;i++){

        cin>>arr[i];

        mx=max(mx,arr[i]);

    }

    ll pos=;

    for(ll i=;i<=n;i++){

        ll x=arr[i];

        ll y=sqrt(x);

        for(ll j=;j<=y;j++){

            ll cnt=;

            while(x%j==){

                x/=j;

                cnt++;

            }

            mp[j]=max(mp[j],cnt);

        }

        if(x!=) mp[x]=max(mp[x],(ll));

    }

    ll sum=;

    for(ll i=;i<=mx;i++)

        sum=(sum%mod*ksm(i,mp[i])%mod)%mod;

    ll ans=;

    for(ll i=;i<=n;i++){

        ans+=sum*ksm(arr[i],mod-)%mod;

    }

    cout<<ans%mod<<endl;

    return ;

}