#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VVI = vector<VI>;
using PII = pair<ll, ll>;
const ll LLINF = (1LL << 60);
const ll INF = (1LL << 30);
const ll MOD = 1000000007;
template <typename T>
T &chmin(T &a, const T &b) {
  return a = min(a, b);
}
template <typename T>
T &chmax(T &a, const T &b) {
  return a = max(a, b);
}
template <typename T>
bool IN(T a, T b, T x) {
  return a <= x && x < b;
}
template <typename T>
T ceil(T a, T b) {
  return a / b + !!(a % b);
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
  out << '(' << a.first << ',' << a.second << ')';
  return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<T> &a) {
  out << '[';
  for (ll i = (ll)0; i < (ll)a.size(); ++i) {
    out << a[i];
    if (i != a.size() - 1) out << ',';
  }
  out << ']';
  return out;
}
ll dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
ll a[200010];
ll cnt[1000010], pow2[1000010], dp[1000010];
signed main(void) {
  ll n;
  scanf("%lld", &n);
  for (ll i = (ll)0; i < (ll)n; ++i) scanf("%lld", &a[i]);
  for (ll i = (ll)0; i < (ll)n; ++i) {
    for (ll j = 1; j * j <= a[i]; ++j) {
      if (a[i] % j == 0) {
        cnt[j]++;
        if (j * j != a[i]) cnt[a[i] / j]++;
      }
    }
  }
  pow2[0] = 1;
  for (ll i = (ll)1; i < (ll)1000010; ++i) pow2[i] = pow2[i - 1] * 2 % MOD;
  ll ret = 0;
  for (ll i = 1000000; i >= 2; --i) {
    dp[i] = cnt[i] * pow2[cnt[i] - 1] % MOD;
    if (dp[i] == 0) continue;
    for (ll j = i * 2; j <= 1000000; j += i) (dp[i] -= dp[j]) %= MOD;
    (dp[i] += MOD) %= MOD;
    (ret += dp[i] * i) %= MOD;
  }
  cout << ret << endl;
  return 0;
}
