#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 51, MOD = 998244353;
int cnt;
int p[MAXN], dp[MAXN];
inline int read() {
  register int num = 0, neg = 1;
  register char ch = getchar();
  while (!isdigit(ch) && ch != '-') {
    ch = getchar();
  }
  if (ch == '-') {
    neg = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    num = (num << 3) + (num << 1) + (ch - '0');
    ch = getchar();
  }
  return num * neg;
}
inline int qpow(int base, int exponent) {
  int res = 1;
  while (exponent) {
    if (exponent & 1) {
      res = 1ll * res * base % MOD;
    }
    base = 1ll * base * base % MOD, exponent >>= 1;
  }
  return res;
}
int main() {
  cnt = read();
  for (register int i = 1; i <= cnt; i++) {
    p[i] = read();
  }
  dp[0] = 1;
  for (register int i = 1; i <= cnt; i++) {
    dp[i] = (long long int)dp[i - 1] * 100 % MOD * qpow(p[i], MOD - 2) % MOD;
    dp[i] = (dp[i] + 1) % MOD;
  }
  printf("%lld\n", (long long int)(dp[cnt] - 1 + MOD) % MOD);
}
