#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

const int max1 = 1e5;

int n, a[max1 + 5];
vector <int> ans;

int main ()
{
    scanf("%d", &n);
    for ( int i = 1; i <= n; i ++ )
        scanf("%d", &a[i]);
    
    for ( int i = 1; i <= n - 1; i ++ )
    {
        ans.push_back(a[i]);
        ans.push_back(a[i + 1]);
        ans.push_back(a[i] | a[i + 1]);
        ans.push_back(a[i] & a[i + 1]);
        ans.push_back(a[i] ^ a[i + 1]);
        ans.push_back(a[i] ^ (a[i] & a[i + 1]));
        ans.push_back(a[i + 1] ^ (a[i] & a[i + 1]));
    }

    sort(ans.begin(), ans.end());
    ans.erase(unique(ans.begin(), ans.end()), ans.end());

    printf("%lu\n", ans.size());

    return 0;
}