#include <stdio.h>
int p[170]={1,
	2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
	73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
	179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
	283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
	419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541,
	547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659,
	661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
	811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941,
	947, 953, 967, 971, 977, 983, 991, 997, 1001};


int n,i,j,k,max,pMax,card,u,pp;
long int n2,sum;

int v[1002];
int c[1002];
int d[1002];

int main(){
  FILE *f = fopen("indep.in","r");
  fscanf(f,"%d",&n);
  for (i=1;i<=n;i++) {
    fscanf(f,"%d",&v[i]);
    if (v[i]>max) max = v[i];
  }

  fclose(f);

  for (i=1;i<=169;i++)
    if (p[i]>max) break;

  pMax = i-1;

  c[1]=1;
  d[1]=0;
  u=1;
  for (i=1;i<=pMax;i++) {

    pp=u;



    for (j=1;j<=pp;j++) {
      if (c[j]*p[i]<=max) {
	u++;
	c[u]=c[j]*p[i];
	d[u]=d[j]+1;

	card=0;
	  for (k=1;k<=n;k++)
	    if (v[k]%c[u]==0)
	      card++;
	n2=(1<<card)-1;
	if (d[u]%2==1)
	  sum-=n2;
	else
	  sum+=n2;
      }
    }


  }

  sum+=((1<<n)-1);

  FILE *g = fopen("indep.out","w");
  fprintf(g,"%ld",sum);
  fclose(g);

  return 0;
}