#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<mint>dp0(n + 1), dp1(n + 1);
	dp1[0] = 1;
	rep(i, n) {
		dp0[i + 1] = pow_mod(2, i, mod);
		dp1[i + 1] = (dp0[i] + dp1[i]) * 2;
	}
	mint ans = 0;
	rep(i, n) {
		int a; cin >> a;
		ans += a * (dp0[i] + dp1[i]) * (dp0[n - 1 - i] + dp1[n - 1 - i]);
	}
	cout << ans.val() << endl;
	return 0;
}