import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      
      int[] ds;
      foreach (i; 0 .. N) {
        for (int d = 1; d * d <= A[i]; ++d) {
          if (A[i] % d == 0) {
            ds ~= d;
            if (d != A[i] / d) {
              ds ~= A[i] / d;
            }
          }
        }
      }
      ds = ds.sort.uniq.array;
      const dsLen = cast(int)(ds.length);
      debug {
        writeln("ds = ", ds);
      }
      
      auto dp = new long[dsLen];
      foreach (j; 0 .. dsLen) {
        dp[j] = 1L << A.count!(a => (a % ds[j] == 0));
      }
      debug {
        writeln("dp = ", dp);
      }
      foreach_reverse (j; 0 .. dsLen) {
        dp[j] -= 1;
        if (ds[j] <= 100) {
          foreach (k; j + 1 .. dsLen) {
            if (ds[k] % ds[j] == 0) {
              dp[j] -= dp[k];
            }
          }
        } else {
          for (int dd = 2 * ds[j]; dd < ds[$ - 1]; dd += ds[j]) {
            const k = ds.lowerBound(dd);
            if (k < dsLen && ds[k] == dd) {
              dp[j] -= dp[k];
            }
          }
        }
      }
      debug {
        writeln("dp = ", dp);
      }
      writeln(dp[0]);
    }
  } catch (EOFException e) {
  }
}