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

// Function to perform XOR basis reduction
vector<int> getXORBasis(vector<int> &A) {
    vector<int> basis(30, 0); // Stores independent binary components
    for (int num : A) {
        for (int i = 29; i >= 0; i--) {
            if ((num >> i) & 1) { // Check if bit i is set
                if (!basis[i]) {
                    basis[i] = num; // Assign as a new basis vector
                    break;
                }
                num ^= basis[i]; // Reduce num using existing basis
            }
        }
    }
    return basis;
}

// Function to compute power (2^rank) % MOD
long long modExp(long long base, long long exp, long long mod) {
    long long result = 1;
    while (exp > 0) {
        if (exp % 2 == 1) result = (result * base) % mod;
        base = (base * base) % mod;
        exp /= 2;
    }
    return result;
}

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

    // Compute XOR basis
    vector<int> basis = getXORBasis(A);

    // Count number of independent basis elements
    int rank = 0;
    for (int i = 0; i < 30; i++) {
        if (basis[i]) rank++;
    }

    // The number of valid sorted sequences is 2^rank % MOD
    cout << modExp(2, rank, MOD) << endl;
    return 0;
}