#include long long power_mod (long long a, long long b, long long mod_num) { long long ans = 1LL; if (b > 0LL) { ans = power_mod(a, b/2LL, mod_num); ans = (ans * ans) % mod_num; if (b%2LL == 1LL) { ans = (ans * a) % mod_num; } } return ans; } int main () { int n = 0; int res = 0; long long ans = 0LL; long long mod_num = 998244353LL; res = scanf("%d", &n); for (int i = 0; i < n; i++) { long long a = 0LL; res = scanf("%lld", &a); ans += (a*power_mod(2LL, (long long)(n-i-1), mod_num))%mod_num; ans += mod_num-(a*power_mod(2LL, (long long)i, mod_num))%mod_num; } printf("%lld\n", ans%mod_num); return 0; }