#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long hun = 828542813;
long long inv(long long a, long long p) {
  long long ex = p - 2, result = 1;
  while (ex > 0) {
    if (ex % 2 == 1) {
      result = (result * a) % p;
    }
    a = (a * a) % p;
    ex /= 2;
  }
  return result;
}
long long e[300005];
long long arr[300005];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &arr[i]);
  }
  for (int i = 0; i < n; ++i) {
    long long ans = 1ll * arr[i] * hun;
    ans %= mod;
    ans = inv(ans, mod);
    ans %= mod;
    if (i > 0)
      e[i] = (ans * (1 + e[i - 1])) % mod;
    else
      e[i] += ans;
    e[i] %= mod;
  }
  printf("%lld\n", e[n - 1]);
}
