#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const ll INFLL = 1LL<<60;
const ll MOD = 998244353;
const double INFD = 1.0E10;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
//const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using Pair = pair<ll, ll>;
using Graph = vector<vector<int>>;
using mint = atcoder::modint998244353;


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    
    ll n; cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    
    vector<ll> cnt(30);
    for (int i = 0; i < n; i++){
        for (int j = 0; j < 30; j++){
            if ((i >> j) & 1) cnt[j]++;
        }
    }
    
    mint ans = 0;
    for (int i = 0; i < n; i++){
        // for (int j = 0; j < 60; j++){
        //     if ((i >> j) & 1) cnt[j]--;
        // }
        
        mint tmp = 0;
        for (int j = 0; j < 30; j++){
            if ((i >> j) & 1) tmp += mint(n - cnt[j]) * (1LL << j);
            else tmp += mint(cnt[j]) * (1LL << j);
        }
        
        // for (int j = 0; j < 30; j++) cerr << j << " - " << cnt[j] << endl;
        
        ans += tmp * a[i];
        // cerr << i << " : " << a[i] << " " << tmp.val() << endl;
    }
    
    cout << ans.val() << endl;
    
    return 0;
}