#include <fstream>

using namespace std;

const char InFile[]="indep.in";
const char OutFile[]="indep.out";
const int HUGEINT_SIZE=256;
const int HUGEINT_BASE=10;
const int MaxX=1024;
const int MaxN=512;

ifstream fin(InFile);
ofstream fout(OutFile);

typedef int HUGEINT[HUGEINT_SIZE];

int N,x,D[MaxX],P[MaxX],CNT[MaxX];
HUGEINT SOL,POW[MaxN];

inline void add(HUGEINT A, HUGEINT B)
{
	int i=1,t=0;
	for(;i<=A[0] || i<=B[0] || t;++i,t/=HUGEINT_BASE)
	{
		A[i]=(t+=(A[i]+B[i]))%HUGEINT_BASE;
	}
	A[0]=i-1;
}

inline void cpy(HUGEINT A, HUGEINT B)
{
	for(register int i=0;i<=B[0];++i)
	{
		A[i]=B[i];
	}
}

inline void write(HUGEINT A)
{
	if(A[0]==0)
	{
		fout<<"0";
	}
	else
	{
		for(register int i=A[0];i>0;--i)
		{
			fout<<A[i];
		}
	}
}

inline void sub(HUGEINT A, HUGEINT B)
{
	int i=1,t=0;
	for(;i<=A[0];++i)
	{
		A[i]-=B[i]+t;
		A[i]+=(t=A[i]<0)*10;
	}
	while(!A[A[0]] && A[0])
	{
		--A[0];
	}
}

int main()
{
	fin>>N;
	for(register int i=1;i<=N;++i)
	{
		fin>>x;
		for(register int j=2;j<=x;++j)
		{
			if(x%j==0)
			{
				++D[j];
			}
		}
	}
	fin.close();
	
	for(register int i=2;i<MaxX;++i)
	{
		P[i]=1;
	}
	for(register int i=2;i<MaxX;++i)
	{
		if(P[i]==1)
		{
			for(register int j=i;j<MaxX;j+=i)
			{
				P[j]*=i;
				++CNT[j];
			}
		}
	}
	
	POW[0][0]=POW[0][1]=1;
	for(register int i=1;i<=N;++i)
	{
		cpy(POW[i],POW[i-1]);
		add(POW[i],POW[i-1]);
	}
	
	for(register int i=1;i<=N;++i)
	{
		sub(POW[i],POW[0]);
	}
	sub(POW[0],POW[0]);
	
	cpy(SOL,POW[N]);
	for(register int i=2;i<MaxX;++i)
	{
		if(P[i]==i)
		{
			if(!(CNT[i]&1))
			{
				if(D[i])
				{
					add(SOL,POW[D[i]]);
				}
			}
		}
	}
	for(register int i=2;i<MaxX;++i)
	{
		if(P[i]==i)
		{
			if(CNT[i]&1)
			{
				if(D[i])
				{
					sub(SOL,POW[D[i]]);
				}
			}
		}
	}
	
	write(SOL);
	fout.close();
	return 0;
}
/*#include <fstream>
#include <algorithm>

using namespace std;

int N, V[502];
int Nbr[1002][202];

inline int cmmdc(int a, int b)
{
    if (b == 0) return a;
    return cmmdc(b, a % b);
}

void Plus(int Pos1, int Pos2)
{
    Nbr[Pos1][0] = max(Nbr[Pos1][0], Nbr[Pos2][0]);

    for (int i = 1; i <= Nbr[Pos1][0]; ++i)
    {
        Nbr[Pos1][i] += Nbr[Pos2][i];
        if (Nbr[Pos1][i] >= 10)
        {
            Nbr[Pos1][i + 1] += Nbr[Pos1][i] / 10;
            Nbr[Pos1][i] %= 10;
            Nbr[Pos1][0] += (i == Nbr[Pos1][0]);
        }
    }
}
void Double(int Pos)
{
    for (int i = 1; i <= Nbr[Pos][0]; ++i)
        Nbr[Pos][i] *= 2;
    for (int i = 1; i <= Nbr[Pos][0]; ++i)
        if (Nbr[Pos][i] >= 10)
        {
            Nbr[Pos][i + 1] += Nbr[Pos][i] / 10;
            Nbr[Pos][i] %= 10;
            Nbr[Pos][0] += (i == Nbr[Pos][0]);
        }
}

int main()
{
    ifstream F("indep.in");
    ofstream G("indep.out");

    Nbr[0][0] = Nbr[0][1] = 1;

    F >> N;
    for (int i = 1; i <= N; ++i)
        F >> V[i];

    for (int i = 1; i <= N; ++i)
    {
        for (int j = 1; j <= 1000; ++j)
            if (cmmdc(V[i], j) == j)
				Double(j);
            else                    
				Plus(cmmdc(V[i], j), j);
        Plus(V[i], 0);
    }

    if (Nbr[1][0] == 0) Nbr[1][0] = 1;
    for (int i = Nbr[1][0]; i >= 1; --i)
        G << Nbr[1][i];

    F.close();
    G.close();
}
*/