#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()

using namespace std;
using ll = long long;

const ll mod = 1e9 + 7;

ll fastPow(ll a, ll p) {
    ll ans = 1;
    while (p) {
        if (p & 1) {
            ans *= a;
            ans %= mod;
        }
        a *= a;
        a %= mod;
        p >>= 1;
    }
    return ans;
}

const int MSIZE = 1e6 + 1;

int t[MSIZE];
int q[MSIZE];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    vector<int> arr(n);
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
        t[arr[i]]++;
    }
    for (int i = 1; i < MSIZE; i++) {
        for (int j = i + i; j < MSIZE; j += i) {
            t[i] += t[j];
            t[i] %= mod;
        }
    }
    for (int i = 1; i < MSIZE; i++) {
        q[i] = (mod + fastPow(2, t[i]) - 1) % mod;
    }
    for (int i = MSIZE - 1; i >= 1; i--) {
        for (int j = i + i; j < MSIZE; j += i) {
            q[i] -= q[j];
            q[i] %= mod;
            if (q[i] < 0) q[i] += mod;
        }
    }
    ll answer = 0;
    for (int i = 1; i < MSIZE; i++) {
        answer += i * 1ll * q[i] % mod;
        answer %= mod;
    }
    cout << answer << endl;
}