#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define endl '\n' #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end()) typedef long long ll; typedef long double ld; typedef pair P; typedef complex comp; typedef vector< vector > matrix; struct pairhash { public: template size_t operator()(const pair &x) const { size_t seed = hash()(x.first); return hash()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2); } }; const int inf = 1e9 + 9; const ll mod = 1e9 + 7; const double eps = 1e-8; const double pi = acos(-1); int n; ll a[100010]; const int N = 100010; int bitset_rank(vector >& b) { int l = b.size(); for (int i = 0; i < l; i++) { sort(b.begin()+i, b.end(), [](const bitset& a, const bitset& b){ return a.to_ulong() > b.to_ulong(); }); int h = -1; for (int j = N-1; j >= 0; j--) { if (b[i][j]) { h = j; break; } } if (h < 0) return i; for (int j = i+1; j < l; j++) { if (b[j][h]) b[j] ^= b[i]; else break; } } return l; } ll solve() { vector > vec; for (int i = 0; i <= 60; i++) { bitset b; for (int j = 0; j < n; j++) { b.set(j, (a[j] >> i) & 1); } vec.push_back(b); } return 1LL << bitset_rank(vec); } void input() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); input(); cout << solve() << endl; }