#include <bits/stdc++.h>
#define int long long
#pragma GCC optimize(2)
using namespace std;
const int mod = 998244353;
int n, a[100005], b[35][2], g[100005], c[35], d[35], f[35][2], ans, sum[35];
inline int ksm(int p, int q = mod - 2) {
	int base = 1;
	while (q) {
		if (q & 1) base = base * p % mod;
		q >>= 1;
		p = p * p % mod;
	}
	return base;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 0; i <= 29; i++) c[i] = 1, sum[i] = 1;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		for (int j = 0; j <= 29; j++) {
			b[j][(a[i] >> j) & 1]++;
			if (a[i] & (1 << (j))) {
			} else {
//				cout << j << ' ' << c[j] << " " << a[j] << ' ' << ((a[j]) & ((1 << (j)) - 1)) + 1 << "**\n";
				c[j] *= ((a[i]) & ((1 << (j)) - 1)) + 1;
				c[j] %= mod;
				sum[j] *= ((a[i]) & ((1 << (j)) - 1)) + 1;
				sum[j] %= mod;
			}
		}
	}
	int p, q, u, v;
	for (int j = 0; j <= 29; j++) {
		f[j][0] = c[j];
		f[j][1] = 0;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= 29; j++) {
			if (a[i] & (1 << (j))) {
				p = f[j][0], q = f[j][1];
				f[j][0] = f[j][1] = 0;
				u = (1 << j), v = ((a[i]) & ((1 << (j)) - 1) ) + 1;
//				cout << i << " " << j << ' ' << u << ' ' << v << ' ' << p << ' ' << q << "\n";
				f[j][1] = (p * v % mod + q * u % mod) % mod, f[j][0] = (p * u % mod + q * v % mod) % mod;
				sum[j] *= v;
				sum[j] %= mod;
			}
		}
	}
	for (int i = 29; i >= 0; i--) {
//		cout << b[i][0] << ' ' << b[i][1] << ' ' << f[i][0] << " " << f[i][1] << " " << sum[i] << ' ' << i << "[]\n";
		if (b[i][1] & 1) {
			ans += f[i][0] * ksm(1 << (i)) % mod;
			ans %= mod;
			break;
		} else {
			ans += (f[i][0] - sum[i] + mod) % mod * ksm(1 << (i)) % mod;
		}
	}
	cout << ans;
}