#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;

vector<Mint> findLinearRecurrence(const vector<Mint> &as) {
  const int n = as.size();
  int d = 0, m = 0;
  vector<Mint> cs(n + 1, 0), bs(n + 1, 0);
  cs[0] = bs[0] = 1;
  Mint invBef = 1;
  for (int i = 0; i < n; ++i) {
    ++m;
    Mint dif = as[i];
    for (int j = 1; j < d + 1; ++j) dif += cs[j] * as[i - j];
    if (dif.x != 0) {
      auto csDup = cs;
      const Mint r = dif * invBef;
      for (int j = m; j < n; ++j) cs[j] -= r * bs[j - m];
      if (2 * d <= i) {
        d = i + 1 - d;
        m = 0;
        bs = csDup;
        invBef = dif.inv();
      }
    }
  }
  cs.resize(d + 1);
  return cs;
}

unsigned xrand() {
  static unsigned x = 314159265, y = 358979323, z = 846264338, w = 327950288;
  unsigned t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8;
}

template <class F> Mint det(int n, F f) {
  for (; ; ) {
    vector<Mint> xs(n), ys(n);
    for (int i = 0; i < n; ++i) xs[i] = xrand();
    for (int i = 0; i < n; ++i) ys[i] = xrand();
    vector<Mint> as(2 * n, 0);
    for (int i = 0; i < 2 * n; ++i) {
      for (int j = 0; j < n; ++j) as[i] += xs[j] * ys[j];
      ys = f(ys);
    }
    const auto cs = findLinearRecurrence(as);
    if ((int)cs.size() == n + 1) return ((n&1)?-1:+1) * cs[n];
  }
}


int N;
vector<int> A;

int M;
vector<int> lpf, phi;

/*
  \sum[v] gcd(A[u], A[v]) ys[v]
  = \sum[v] (\sum[i] [i | A[u]] [i | A[v]] phi(i)) ys[v]
  = \sum[i] [i | A[u]] phi(i) \sum[v] [i | A[v]] ys[v]
*/
vector<Mint> calc(const vector<Mint> &ys) {
  const int ysLen = ys.size();
  vector<Mint> fs(M + 1, 0);
  for (int v = 0; v < ysLen; ++v) fs[A[v]] += ys[v];
  for (int p = 2; p <= M; ++p) if (lpf[p] == p) {
    for (int n = M / p, nn = n * p; n; --n, nn -= p) fs[n] += fs[nn];
  }
  for (int n = 1; n <= M; ++n) fs[n] *= phi[n];
  for (int p = 2; p <= M; ++p) if (lpf[p] == p) {
    for (int n = 1, nn = p; nn <= M; ++n, nn += p) fs[nn] += fs[n];
  }
  vector<Mint> ret(ysLen);
  for (int u = 0; u < ysLen; ++u) ret[u] = fs[A[u]];
  return ret;
}

int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &A[u]);
    }
    
    M = *max_element(A.begin(), A.end());
    lpf.assign(M + 1, 0);
    phi.assign(M + 1, 0);
    for (int p = 2; p <= M; ++p) lpf[p] = p;
    for (int n = 1; n <= M; ++n) phi[n] = n;
    for (int p = 2; p <= M; ++p) if (lpf[p] == p) {
      for (int n = p; n <= M; n += p) {
        chmin(lpf[n], p);
        (phi[n] /= p) *= (p - 1);
      }
    }
    
    const auto deg = calc(vector<Mint>(N, 1));
// cerr<<"deg = "<<deg<<endl;
    const Mint ans = det(N - 1, [&](const vector<Mint> &ys) -> vector<Mint> {
      auto res = calc(ys);
      for (int u = 0; u < N - 1; ++u) res[u] = deg[u] * ys[u] - res[u];
      return res;
    });
    printf("%u\n", ans.x);
  }
  return 0;
}