Problem:
Score : 500 points

Problem Statement

Given are N positive integers A_1,...,A_N.

Consider positive integers B_1, ..., B_N that satisfy the following condition.

Condition: For any i, j such that 1 \leq i < j \leq N, A_i B_i = A_j B_j holds.

Find the minimum possible value of B_1 + ... + B_N for such B_1,...,B_N.

Since the answer can be enormous, print the sum modulo (10^9 +7).

Constraints

1 \leq N \leq 10^4

1 \leq A_i \leq 10^6

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 ... A_N

Output

Print the minimum possible value of B_1 + ... + B_N for B_1,...,B_N that satisfy the condition, modulo (10^9 +7).

Sample Input 1

3
2 3 4

Sample Output 1

13

Let B_1=6, B_2=4, and B_3=3, and the condition will be satisfied.

Sample Input 2

5
12 12 12 12 12

Sample Output 2

5

We can let all B_i be 1.

Sample Input 3

3
1000000 999999 999998

Sample Output 3

996989508

Print the sum modulo (10^9+7).

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h> 

using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;

#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()

ll modpow(ll x,ll n){
  if(n==0)return 1;
  if(n%2)return ((x%MOD)*(modpow(x,n-1)%MOD))%MOD;
  else {
    ll half=modpow(x,n/2)%MOD;
    return (half*half)%MOD;
  }
}

ll gcd(ll a,ll b){
  if(a==0)return b;
  return gcd(b%a,a);
}

ll lcm(ll a,ll b){
  //a%=MOD;
  //b%=MO;
  return (a/gcd(a,b)*b);//*modpow(gcd(a,b),MOD-2))%MOD;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);

  int N;
  cin>>N;
  vector<ll>A(N);
  for(int i=0;i<N;i++)cin>>A[i];
  ll a=1;
  for(auto it:A)a=lcm(a,it);
  a%=MOD;
  ll ans=0;
  for(auto it:A){
    ans+=a*modpow(it,MOD-2);
    ans%=MOD;
  }
  cout<<ans%MOD<<endl;
  return 0;
}