#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

const int MAXCF = 350;
const int VMAX = 1000;
const int NMAX = 500;
const int BASE = 10000;


class Huge {
private:
  int cf[MAXCF];

public:
  Huge(int x = 0) {
    cf[0] = 0;
    if(!x)
      cf[0] = 1, cf[1] = 0;
    while(x) {
      cf[0]++;
      cf[cf[0]] = x % BASE;
      x /= BASE;
    }
  }

  bool is0() {
    return !cf[0];
  }

  void fill0(int dim) {
    for(int i = cf[0] + 1; i <= dim; i++)
      cf[i] = 0;
  }

  const Huge operator = (const Huge &dr) {
    for(int i = 0; i <= dr.cf[0]; i++)
      cf[i] = dr.cf[i];
    return *this;
  }

  Huge operator + (Huge &dr) {
    Huge ans = Huge();
    ans.cf[0] = max(cf[0], dr.cf[0]);

    fill0(ans.cf[0]);
    dr.fill0(ans.cf[0]);

    int r = 0;
    for(int i = 1; i <= ans.cf[0]; i++) {
      ans.cf[i] = cf[i] + dr.cf[i] + r;
      r = ans.cf[i] / BASE;
      ans.cf[i] %= BASE;
    }

    if(r)
      ans.cf[++ans.cf[0]] = r;

    return ans;
  }

  Huge operator + (int x) {
    Huge dr = x;
    return *this + dr;
  }

  Huge operator - (Huge &dr) {
    Huge ans = Huge();
    ans.cf[0] = max(cf[0], dr.cf[0]);

    fill0(ans.cf[0]);
    dr.fill0(ans.cf[0]);

    int r = 0;
    for(int i = 1; i <= ans.cf[0]; i++) {
      ans.cf[i] = cf[i] - r - dr.cf[i];
      r = 0;
      if(ans.cf[i] < 0) {
        ans.cf[i] += 10;
        r = 1;
      }
    }

    while(ans.cf[0] > 1 && ans.cf[ans.cf[0]] == 0)
      ans.cf[0]--;

    return ans;
  }

  Huge operator - (int x) {
    Huge dr = x;
    return *this - dr;
  }

  void print() {
    for(int i = cf[0]; i >= 1; i--) {
      const char *format = (i == cf[0]) ? "%d" : "%04d";
      printf(format, cf[i]);
    }
  }
};


vector<int> prime, add, sub;
int frecv[VMAX + 5], nr_multipli[VMAX + 5];
Huge p2[NMAX + 5];

void gen_prime() {
  bool ciur[VMAX + 5];
  ciur[0] = ciur[1] = true;

  for(int i = 2; i <= VMAX; i++)
    if(!ciur[i]) {
      prime.push_back(i);
      for(int j = 2 * i; j <= VMAX; j += i)
        ciur[j] = true;
    }
}

void gen_coef() { /// principiul includerii si excluderii
  add.push_back(1);
  for(int i = 2; i <= VMAX; i++) {
    int nr_div_primi = 0, aux = i;
    bool ok = true;

    for(int prim: prime) {
      if(prim * prim > aux)
        break;

      if(aux % prim == 0) {
        nr_div_primi++;
        aux /= prim;
        if(aux % prim == 0) {
          ok = false;
          break;
        }
      }
    }
    if(aux > 1)
      nr_div_primi++;

    if(ok)
      if(nr_div_primi % 2 == 1)
        sub.push_back(i);
      else
        add.push_back(i);
  }
}

void gen_nr_multipli() {
  for(int i = 1; i <= VMAX; i++)
    for(int j = i; j <= VMAX; j += i)
      nr_multipli[i] += frecv[j];
}

void gen_p2(int n) {
  p2[0] = 1;
  for(int i = 1; i <= n; i++)
    p2[i] = p2[i - 1] + p2[i - 1];
}

void solve() {
  Huge ans = 0;

  for(int idx: add)
    ans = ans + p2[nr_multipli[idx]] - 1;
  for(int idx: sub)
    ans = (ans + 1) - p2[nr_multipli[idx]];
  ans.print();
}

int main() {
  freopen("indep.in", "r", stdin);
  freopen("indep.out", "w", stdout);
  int n, x;

  gen_prime();
  gen_coef();

  scanf("%d", &n);
  for(int i = 1; i <= n; i++) {
    scanf("%d", &x);
    frecv[x]++;
  }

  gen_nr_multipli();
  gen_p2(n);

  solve();

  return 0;
}