#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    int m = 20;
    vector<ll> c(m);
    ll s = 0;
    rep(i, n) {
        rep(j, m) {
            if (i >> j & 1)
                c[j]++;
        }
        s += i;
    }
    mint ans = 0;
    rep(i, n) {
        ll a;
        cin >> a;
        ll t = s;
        rep(j, m) {
            if (i >> j & 1) {
                t -= ((ll)1 << j) * (c[j]);
                t += ((ll)1 << j) * (n - c[j]);
            }
        }
        ans += a * t;
    }
    cout << ans.val() << endl;
    return 0;
}