#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<cstdlib>

#include<ctime>

#include<vector>

#include<algorithm>

#include<queue>

#include<map>

using namespace std;

#define LL long long

int n;

LL x=;

int b[<<],c[<<];

void init(){

    cin>>n;

    int y,p;

    for(int i=;i<=n;i++){

        scanf("%I64d",&x);

        p=;

        while(x!=){

            y=x%;

            x/=;

            p=p|(<<y);

        }

        b[p]++;

    }

}

LL col(LL x){return x*(x-)/;}

void work(){

    for(int i=;i<<<;i++)

        for(int j=;j<<<;j++)

            if((i|j)==i)c[j]+=b[i];

    int sum=;

    LL ans=;

    for(int i=;i<<<;i++){

        sum=;

        for(int j=;j<;j++){

            if(i&(<<j))sum++;

        }

        if(sum%)ans+=col(c[i]);

        else ans-=col(c[i]);

    }

    cout<<ans<<endl;

}

int main(){

    //freopen("1.in","r",stdin);

    //freopen("1.out","w",stdout);

    init();

    work();

}