#include<bits/stdc++.h>
using namespace std;
set<int>s;
struct dat{
	int prev;
	int next;
};
queue<dat>q;
int main(){
	int n,x,y;
	cin>>n;
	//int ans=0;
	for(int i=1;i<=n;i++){
		cin>>x;
		if(s.find(x)==s.end()){
			s.insert(x);
			//ans++;
		}
		if(i>1){
			q.push((dat){y,x});
		}
		y=x;
	}
	dat now;
	int k1,k2,k3;
	while(!q.empty()){
		now=q.front();
		q.pop();
		//cout<<now.next<<" "<<now.prev<<endl;
		k1=now.prev&now.next;
		k2=now.prev|now.next;
		k3=now.prev^now.next;
		if(k3!=0&&s.find(k3)==s.end()){
			//ans++;
			s.insert(k3);
			//cout<<"XOR inserting "<<k3<<endl;
			q.push((dat){now.prev,k3});
			q.push((dat){k3,now.next});
		}
		else if(k2!=0&&s.find(k2)==s.end()){
			//ans++;00
			s.insert(k2);
			//cout<<"OR inserting "<<k2<<endl;
			q.push((dat){now.prev,k2});
			q.push((dat){k2,now.next});
		}
		else if(k1!=0&&s.find(k1)==s.end()){
			//ans++;
			s.insert(k1);
			//cout<<"AND inserting "<<k1<<endl;
			q.push((dat){now.prev,k1});
			q.push((dat){k1,now.next});
		}
	}
	if(s.find(0)==s.end()){
		s.insert(0);
	}
	cout<<s.size()<<endl;
	return 0;
}