#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const long long maxn = 1e6;
const long long mod = 998244353;
const long long inf = 0x3f3f3f3f;
long long qp(long long x, long long y) {
  long long ans = 1;
  while (y) {
    if (y & 1) ans = ans * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long p[maxn];
long long pre100[maxn];
long long pre[maxn];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  pre[0] = 1;
  long long n;
  cin >> n;
  for (long long i = 1; i <= n; ++i) {
    cin >> p[i];
    pre[i] = pre[i - 1] * p[i] % mod;
  }
  long long tmp = 1;
  for (long long i = n; i >= 0; --i) pre100[i] = tmp, tmp = 100 * tmp % mod;
  long long ans = 0;
  for (long long i = 0; i < n; ++i)
    ans = (ans + pre100[i] * pre[i] % mod) % mod;
  ans = ans * qp(pre[n], mod - 2) % mod;
  cout << ans;
  return 0;
}
