#include <bits/stdc++.h>
const int maxn = 1e6 + 9, mod = 998244353;
int p[maxn], f[maxn];
int Read() {
  int x(0), f(1);
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + c - '0';
    c = getchar();
  }
  return x * f;
}
int Pow(int base, int b) {
  int ret(1);
  while (b) {
    if (b & 1) ret = 1ll * ret * base % mod;
    base = 1ll * base * base % mod;
    b >>= 1;
  }
  return ret;
}
int T, n;
int main() {
  n = Read();
  for (int i = 1; i <= n; ++i) p[i] = Read();
  f[1] = 1;
  for (int i = 2; i <= n + 1; ++i) {
    f[i] =
        (1ll * f[i - 1] * 100 % mod * Pow(p[i - 1], mod - 2) % mod + 1) % mod;
  }
  printf("%d\n", (1ll * f[n + 1] - 1 + mod) % mod);
  return 0;
}
