#include <bits/stdc++.h>
using namespace std;
const int N = 200100;
long long n, p[N], mod = 998244353, ans = 1, curr = 1;
long long pw(long long x, long long os) {
  if (os == 0) return 1;
  if (os == 1) return x;
  long long z = pw(x, os / 2);
  if (os & 1) return z * z % mod * x % mod;
  return z * z % mod;
}
long long modInv(long long x) { return pw(x, mod - 2); }
int main() {
  scanf("%lld", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &p[i]);
    p[i] = p[i] * modInv(100) % mod;
  }
  for (int i = 1; i <= n - 1; i++) {
    curr = (curr * p[i]) % mod;
    ans = (ans + curr) % mod;
  }
  curr = (curr * p[n]) % mod;
  printf("%lld", ans * modInv(curr) % mod);
}
