#include <bits/stdc++.h>
using namespace std;
inline long long in() {
  long long x = 0, flag = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
  return x * flag;
}
int n;
const int MAXN = 2e5 + 10;
const long long MOD = 998244353;
long long p[MAXN], e[MAXN];
long long fpow(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1)
      b ^= 1, (ret *= a) %= MOD;
    else
      b >>= 1, (a *= a) %= MOD;
  }
  return ret;
}
long long inv(long long x) { return fpow(x % MOD, MOD - 2); }
long long d[MAXN], k[MAXN];
int main() {
  n = in();
  for (int i = 1; i <= n; ++i) p[i] = in() * inv(100) % MOD;
  for (int i = n; i >= 1; --i) {
    d[i] = (1ll + p[i] * d[i + 1] % MOD) % MOD;
    k[i] = (p[i] * k[i + 1] % MOD + 1ll + MOD - p[i]) % MOD;
  }
  e[1] = d[1] * inv(1ll + MOD - k[1]) % MOD;
  printf("%lld\n", e[1]);
  return 0;
}
