#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;
constexpr int FACT_SIZE = 1000000;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
    Fact[0] = mint::raw(1);
    for(int i = 1; i <= FACT_SIZE; ++i) {
        Fact[i] = Fact[i-1] * i;
    }
    iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
    for(int i = FACT_SIZE; i; --i) {
        iFact[i-1] = iFact[i] * i;
    }
    return false;
}();

mint comb(int n, int k) {
    if (k == 0) return mint::raw(1);
    assert(n >= 0 && k >= 0);
    if (k > n) return mint::raw(0);
    return Fact[n] * iFact[n - k] * iFact[k];
}

mint icomb(int n, int k) {
    return iFact[n] * Fact[n - k] * Fact[k];
}

mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
    assert(0 <= n);
    return Fact[n] * iFact[n - k];
}

const mint f13 = mint(1) / 3, f23 = mint(2) / 3;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  rep(i, n) cin >> a[i];
  int x = 0;
  for(int y: a) x ^= y;
  int cnt = 0;
  if (x != 0) {
    cnt++;
    int mn = 1001001001;
    int imn = -1;
    rep(i, n) {
      if ((a[i] ^ x) < a[i]) {
        int diff = __builtin_popcount(a[i] ^ x) - __builtin_popcount(a[i]);
        if (diff < mn) {
          mn = diff;
          imn = i;
        }
      }
    }
    a[imn] ^= x;
  }
  rep(i, n) cnt += __builtin_popcount(a[i]);
  mint c0, c1;
  rep(i, cnt) {
    if (i % 2 == 0) {
      c0 += comb(cnt, i) * f13.pow(i) * f23.pow(cnt - i);
    } else {
      c1 += comb(cnt, i) * f13.pow(i) * f23.pow(cnt - i);
    }
  }
  mint ans;
  if (cnt % 2 == 0) {
    ans = c1;
  } else {
    ans = c0;
  }
  cout << ans.val() << endl;
}