#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;

    for(int i = 0; i < N; i++){
        ans += A[i] * N*(N-1)/2;
    }
    cout << ans.val() << endl;
}