#include <iostream>
#include <vector>
#include <unordered_set>

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    
    unordered_set<int> uniqueValues;
    for (int num : a) {
        uniqueValues.insert(num);
    }
    
    // To maximize the distinct values, we need to consider the closure under AND, OR, and XOR.
    // For practical purposes and efficiency, we use the bitwise OR of all elements to determine the upper bound.
    int bitwiseOR = 0;
    for (int num : a) {
        bitwiseOR |= num;
    }
    
    // The maximum number of distinct values is 2^m, where m is the number of set bits in bitwiseOR
    int m = 0;
    for (int i = 0; i < 31; ++i) {
        if (bitwiseOR & (1 << i)) {
            m++;
        }
    }
    
    int answer = 1 << m;
    cout << answer << endl;
    
    return 0;
}