#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

// a + bx
struct S {
  mint a, b;
  S& operator+=(const S& rhs) {
    a += rhs.a;
    b += rhs.b;
    return *this;
  }
  friend S operator*(mint c, const S& rhs) {
    return S{rhs.a, c * rhs.a + rhs.b};
  }
};
} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  S dp[3];
  dp[0].a = 1;
  int n;
  cin >> n;
  rep(i, n) {
    int x;
    cin >> x;
    S ndp[3];
    ndp[0] += dp[0];
    ndp[0] += dp[0];
    ndp[1] += x * dp[0];
    ndp[1] += dp[1];
    ndp[2] += dp[1];
    ndp[1] += x * dp[1];
    ndp[2] += dp[2];
    ndp[2] += dp[2];
    swap(dp, ndp);
  }
  mint ans = dp[1].b + dp[2].b;
  cout << ans.val() << '\n';
}