#include<iostream>
#include<cstdio>
using namespace std;
const int y=(1<<13)-1;
long long ans=0,a[60];
int n;
void dfs(int x,long long yh,long long yu,int q)
{
    if(x==n+1)
    {
        if(yh==yu&&q!=0)
        {
            ans++;
        }
        return;
    }
    dfs(x+1,yh^a[x],yu&a[x],q+1);
    dfs(x+1,yh,yu,q);
}
int main()
{
    freopen("hihocoderA.in","r",stdin);
    freopen("hihocoderA.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    dfs(2,a[1],a[1],1);
    dfs(2,0,y,0);
    cout<<ans;
    return 0;
}