#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
const long long mod = 998244353;
long long p[N], f[N], s[N];
long long power(long long a, int b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = 1LL * ans * a % mod;
    a = 1LL * a * a % mod;
    b >>= 1;
  }
  return ans;
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", &p[i]);
    p[i] = 1LL * p[i] * power(100, mod - 2) % mod;
  }
  f[0] = 0;
  for (int i = 1; i <= n; ++i) {
    f[i] = (power(p[i], mod - 2) +
            s[i - 1] * (1 - p[i] + mod) % mod * power(p[i], mod - 2) % mod) %
           mod;
    s[i] = (s[i - 1] + f[i]) % mod;
  }
  printf("%lld\n", s[n]);
  return 0;
}
