#include <stdio.h>
int prim(int x,int y)
{
  int r;
  r=x%y;
  while (r)
    {
      x=y;
      y=r;
      r=x%y;
    }
  return y-1;
}

FILE *f,*g;
int main()
{
  int n,a[501],i,j;
  long s=0;
  f=fopen("indep.in","rt");
  g=fopen("indep.out","wt");
  fscanf(f,"%d\n",&n);
  for (i=1;i<=n;i++)
    fscanf(f,"%d\n",&a[i]);
  for (i=1;i<=n;i++)
    for (j=i+1;j<=n;j++)
      {
	if (!prim(a[i],a[j]))
	  {
	    s+=1<<n-j;
	  }
      }
  fprintf(g,"%ld\n",s);
  fclose(f);
  fclose(g);
  return 0;
}