#include <bits/stdc++.h>
template <class T> inline bool chmin(T &x, const T &y) { return x > y ? x = y, true : false; }
template <class T> inline bool chmax(T &x, const T &y) { return x < y ? x = y, true : false; }
using namespace std;
using pii=pair<int,int>;

template <int mod>
class modint
{
    int val;
public:
    constexpr modint() noexcept : val{0} {}
    constexpr modint(long long x) noexcept : val((x %= mod) < 0 ? mod + x : x) {}
    constexpr long long value() const noexcept { return val; }
    constexpr modint operator++(int) noexcept { modint t = *this; return ++val, t; }
    constexpr modint operator--(int) noexcept { modint t = *this; return --val, t; }
    constexpr modint &operator++() noexcept { return ++val, *this; }
    constexpr modint &operator--() noexcept { return --val, *this; }
    constexpr modint operator-() const noexcept { return modint(-val); }
    constexpr modint &operator+=(const modint &other) noexcept { return (val += other.val) < mod ? 0 : val -= mod, *this; }
    constexpr modint &operator-=(const modint &other) noexcept { return (val += mod - other.val) < mod ? 0 : val -= mod, *this; }
    constexpr modint &operator*=(const modint &other) noexcept { return val = (long long)val * other.val % mod, *this; }
    constexpr modint &operator/=(const modint &other) noexcept { return *this *= inverse(other); }
    constexpr modint operator+(const modint &other) const noexcept { return modint(*this) += other; }
    constexpr modint operator-(const modint &other) const noexcept { return modint(*this) -= other; }
    constexpr modint operator*(const modint &other) const noexcept { return modint(*this) *= other; }
    constexpr modint operator/(const modint &other) const noexcept { return modint(*this) /= other; }
    constexpr bool operator==(const modint &other) const noexcept { return val == other.val; }
    constexpr bool operator!=(const modint &other) const noexcept { return val != other.val; }
    constexpr bool operator!() const noexcept { return !val; }
    friend constexpr modint operator+(long long x, modint y) noexcept { return modint(x) + y; }
    friend constexpr modint operator-(long long x, modint y) noexcept { return modint(x) - y; }
    friend constexpr modint operator*(long long x, modint y) noexcept { return modint(x) * y; }
    friend constexpr modint operator/(long long x, modint y) noexcept { return modint(x) / y; }
    static constexpr modint inverse(const modint &other) noexcept
    {
        assert(other != 0);
        int a{mod}, b{other.val}, u{}, v{1}, t{};
        while(b) t = a / b, a ^= b ^= (a -= t * b) ^= b, u ^= v ^= (u -= t * v) ^= v;
        return {u};
    }
    static constexpr modint pow(modint other, long long e) noexcept
    {
        if(e < 0) e = e % (mod - 1) + mod - 1;
        modint res{1};
        while(e) { if(e & 1) res *= other; other *= other, e >>= 1; }
        return res;
    }
    friend std::ostream &operator<<(std::ostream &os, const modint &other) noexcept { return os << other.val; }
    friend std::istream &operator>>(std::istream &is, modint &other) noexcept { long long val; other = {(is >> val, val)}; return is; }
}; // class modint

long long lcm(long long x,long long y) {return x/__gcd(x,y)*y;}

bool p[1<<20];
int ord[1<<20];
bool is[1<<20];

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

    using mint=modint<(int)1e9+7>;

    mint ans=0,ans2=1;
    int n; cin>>n;
    for(int i=n; i--;) {
        int a; cin>>a; is[a]=1;
        ans+=mint::inverse(a);
    }

    fill(begin(p),end(p),1);
    for(int i=2; i<=1000000; ++i){
        if(p[i]){
            int maxo=0;
            for(int x=1; x*i<=1000000; x++){
                if(x%i){
                    ord[i*x]=1;
                }else{
                    ord[i*x]=ord[x]+1;
                }
                if(is[x*i]){
                    maxo=max(maxo,ord[x*i]);
                }
                p[i*x]=0;
            }
            ans2*=mint::pow(i,maxo);
        }
    }
    cout << ans*ans2 << "\n";


}


Measured memory_bytes: 6400