#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    set<vector<int>> unique_Bs;

    for (int X = 0; X < (1 << 10); X++) { // Small upper bound for X (optimization needed)
        vector<int> B(N);
        for (int i = 0; i < N; i++) {
            B[i] = A[i] ^ X;
        }
        sort(B.begin(), B.end());
        for (int i = 0; i < N; i++) {
            B[i] ^= X;
        }
        unique_Bs.insert(B);
    }

    cout << unique_Bs.size() % MOD << endl;
    return 0;
}