#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;
using ll = long long;

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

    mint ans = 0;
    ll jsum = N*(N-1) / 2;

    for(int i = 0; i < N; i++){
        ll nowjsum = jsum;
        for(int bit = 0; bit < 20; bit++){
            if(i & (1ll<<bit)){
                ll bitcount = N/(1ll<<(bit+1))*(1ll<<bit) + max(0ll,N%(1ll<<(bit+1))-(1ll<<bit));
                nowjsum += (N-bitcount)*(1ll<<bit);
                nowjsum -= bitcount*(1ll<<bit);
            }
        }
        ans += nowjsum * A[i];
    }
    cout << ans.val() << endl;
}