#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const long long mod = 998244353;
int n;
int p[N];
long long k = 1, b = 0;
long long qmi(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
  }
  for (int i = 1; i <= n; i++) {
    long long tmp1 =
        (100 * k + p[i] - 100 + mod) % mod * qmi(p[i], mod - 2) % mod;
    long long tmp2 = (100 * b - 100 + mod) % mod * qmi(p[i], mod - 2) % mod;
    k = tmp1, b = tmp2;
  }
  b = (mod - b) % mod;
  long long ans = b * qmi(k, mod - 2) % mod;
  cout << ans << '\n';
}
