#include<bits/stdc++.h>

using namespace std;

#define debug(n) cerr << #n << ':' << n << endl;
#define dline    cerr << __LINE__ << endl;

using ll = long long;
using ull = unsigned long long;
template<class T, class U> using P = pair<T,U>;
template<class T> using Heap = priority_queue<T>;
template<class T> using heaP = priority_queue<T,vector<T>,greater<T>>;
template<class T,class U> using umap = unordered_map<T,U>;
template<class T> using uset = unordered_set<T>;

template<class T>
bool ChangeMax(T&a,const T&b){
  if(a >= b) return false;
  a = b;    return true;
}

template<class T>
bool ChangeMin(T&a,const T&b){
  if(a <= b) return false;
  a = b;    return true;  
}

template<class T, size_t N, class U>
void Fill(T (&a)[N], const U&v){
    fill((U*)a,(U*)(a+N),v);
}

template<class T>
istream& operator >> (istream&is, vector<T>&v){
  for(auto&e:v)is >> e;
  return is;
}

template<long long mod>
class modint{
private:
  long long extgcd(long long a, long long b, long long&x, long long&y)const {
    long long d = a;
    if(b != 0){d = extgcd(b, a%b, y, x);  y -= (a/b) * x;}
    else{x = 1; y = 0;}
    return d;
  }
  long long modinverse()const{
    long long x, y;
    extgcd(num, mod, x, y);
    return (mod + x%mod)%mod;
  }
public:
  long long num;
  modint():num(0){}
  modint(const long long x):num((x < 0?(x+mod):x)%mod ){}
  friend modint operator+(const modint&a, const modint&b)
  {    return modint(a.num + b.num);  }
  friend modint operator-(const modint&a, const modint&b)
  {    return modint(a.num - b.num);  }
  friend modint operator*(const modint&a, const modint&b)
  {    return modint(a.num * b.num);  }
  friend modint operator/(const modint&a, const modint&b)
  {    return modint(a*b.modinverse());  }
  modint& operator+=(const modint&b)
  {    return (*this) = (*this) + b;  }
  modint& operator-=(const modint&b)
  {    return (*this) = (*this) - b;  }
  modint& operator*=(const modint&b)
  {    return (*this) = (*this) * b;  }
  modint& operator/=(const modint&b)
  {    return (*this) = (*this) / b;  }
  modint& operator++()
  {    (*this)+=1; return (*this);  }
  modint& operator--()
  {    (*this)-=1; return (*this);  }
  modint operator++(int){
    modint tmp(*this);
    ++(*this);
    return tmp;
  }
  modint operator--(int){
    modint tmp(*this);
    --(*this);
    return tmp;
  }    
  modint pow(unsigned long long i){
    if(i == 0) return 1;
    if(i & 1){
      return (*this) * (this->pow(i-1));
    }
    modint<mod>hpow = (this->pow(i>>1));
    return hpow * hpow;
  }
  friend ostream& operator<<(ostream&os, const modint&a){
    os << a.num;
    return os;
  }
  friend istream& operator>>(istream&is, modint&a){
    long long x; is >> x;
    a = x;
    return is;
  }
};

constexpr int mod = 1000000007;

using mint = modint<mod>;

map<ll,ll> mp;


void Update(int n, bool f = true){
  static umap<ll,ll> f_mp;
  if(f)f_mp = move(umap<ll,ll>());
  if(n <= 1) return;
  for(int i = 2; i * i <= n; ++i){
    if(n % i == 0){
      Update(i,false);
      Update(n/i,false);
      return;
    }
  }
  f_mp[n]++;
  ChangeMax(mp[n],f_mp[n]);
}

map<ll,ll> mp2;
void F(int n,bool f = true){
  if(f){
    mp2 = move(map<ll,ll>());
  }
  if(n <= 1)return;
  for(int i = 2; i * i <= n; ++i){
    if(n % i == 0){
      F(i,false);
      F(n/i,false);
      return;
    }
  }
  mp2[n]++;
}

int main(){
  int n; cin >> n;
  vector<int> v(n); cin >> v;
  
  mint ans(0);
  for(auto e:v)Update(e);
  mint sum(1);
  for(auto e:mp){
    sum *= mint(e.first).pow(e.second);
  }
  for(auto e:v){
    F(e);
    mint x(1);
    for(auto ee:mp2){
      x *= mint(ee.first).pow(ee.second);
    }
    ans += sum / x;
    // for(auto ee:sum){
    //   x *= mint(ee.first).pow(ee.second);      
    // }
    // ans += x;
  }
  cout << ans << endl;
}


Measured memory_bytes: 4176