#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <atcoder/modint>

using namespace std;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)

using modint = atcoder::static_modint<998244353>;



int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N; cin >> N;
    vector<u64> A(N); rep(i,N) cin >> A[i];
    set<u64> S(A.begin(), A.end());
    A = vector<u64>(S.begin(), S.end());
    modint ans = 1;
    rep(d,30){
        u64 D = 1ull << d;
        for(u64 a : A){
            u64 l = (a^D)&~(D-1);
            u64 r = l+D;
            if(S.lower_bound(l) != S.lower_bound(r)){ ans *= 2; break; }
        }
    }
    cout << ans.val() << '\n';
    return 0;
}