#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline bool isSquare(T x) {
  T y = sqrt(x + 0.5);
  return (y * y) == x;
}
template <class T1, class T2>
inline T1 gcd(T1 a, T2 b) {
  return b ? gcd(b, a % b) : a;
}
template <class T1, class T2>
inline T1 eqMin(T1& x, const T2& y) {
  if (T1(y) < x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 eqMax(T1& x, const T2& y) {
  if (T1(y) > x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 min(const T1& x, const T2& y) {
  return x < (T1)y ? x : (T1)y;
}
template <class T1, class T2>
inline T1 max(T1& x, const T2& y) {
  return x > (T1)y ? x : (T1)y;
}
template <typename T>
inline T getint() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') p = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * p;
}
struct _flag_t {
  string val;
} const _1d{", "}, _2d{"\n  "};
_flag_t _flag = _1d;
ostream& operator<<(ostream& os, _flag_t flag) {
  _flag = flag;
  return os;
}
template <class CharT, class Traits, class It>
basic_ostream<CharT, Traits>& _out(basic_ostream<CharT, Traits>& os, It f,
                                   It l) {
  if (f == l) return os << "{}";
  _flag_t cur_flag = _flag;
  os << _1d << "{ " << *f;
  for (; ++f != l; os << cur_flag.val << *f)
    ;
  return os << " }";
}
template <class CharT, class Traits, class C>
auto operator<<(basic_ostream<CharT, Traits>& os, C const& cont)
    -> decltype(begin(cont), end(cont), cont.size(), os) {
  return _out(os, begin(cont), end(cont));
}
template <class X, class Y>
ostream& operator<<(ostream& os, pair<X, Y> const& p) {
  return os << "[" << p.first << ", " << p.second << "]";
}
const double PI = acos(-1);
const double EPS = 1e-8;
const int INF = (int)2e9;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)1e6 + 10;
int n;
int a[MAXN];
int step[MAXN], cnt[MAXN], mob[MAXN];
void input() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    a[x]++;
  }
  for (int i = 1; i <= 100000; i++) {
    int x = i;
    for (int j = 1; j * j <= x; j++) {
      if (x % j == 0) {
        cnt[j] += a[i];
        if (x / j != j) {
          cnt[x / j] += a[i];
        }
      }
    }
    int v = x;
    mob[v] = 1;
    for (int j = 2; j * j <= x; j++) {
      if (x % j == 0) {
        mob[v] *= -1;
        x /= j;
      }
      while (x % j == 0) {
        mob[v] = 0;
        x /= j;
      }
    }
    if (x != 1) mob[v] *= -1;
  }
}
void init() {
  step[0] = 1;
  for (int i = 1; i < MAXN; i++) {
    step[i] = (2 * step[i - 1]) % MOD;
  }
}
void solve() {
  long long ans = 0;
  for (int i = 1; i < MAXN; i++) {
    if (!cnt[i]) continue;
    long long c = (step[cnt[i]] - 1 + MOD) % MOD;
    ans = ((long long)ans + c * mob[i] + MOD) % MOD;
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  input();
  init();
  solve();
}
