#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const long long mod = 998244353;
int n;
long long a[maxn], b[maxn];
long long pw(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y % 2 == 1) res = res * x % mod;
    x = x * x % mod;
    y /= 2;
  }
  return res;
}
long long inv(long long x) {
  long long res = mod - 2;
  return pw(x, res);
}
long long tmpa, tmpb;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (int i = 1; i <= n; i++) b[i] = 100 - a[i];
  tmpa = b[n];
  tmpb = 100;
  for (int i = n - 1; i; i--) {
    tmpa = tmpa * inv((long long)100) % mod;
    tmpb = tmpb * inv((long long)100) % mod;
    tmpa = tmpa * a[i] % mod;
    tmpa = (tmpa + b[i]) % mod;
    tmpb = tmpb * a[i] % mod;
    tmpb = (tmpb + (long long)100) % mod;
  }
  long long tmp = ((long long)100 - tmpa + mod) % mod;
  long long ans = tmpb * inv(tmp) % mod;
  printf("%lld", ans);
  return 0;
}
