#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
int n;
long long p[200005], dp[200005];
long long fp(long long x, long long y) {
  long long ret = 1;
  while (y) {
    if (y & 1) ret = ret * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ret;
}
inline long long inv(long long x) { return fp(x, mod - 2) % mod; }
int main() {
  long long s = 0;
  scanf("%d", &n);
  p[0] = p[n + 1] = 100;
  for (int i = 1; i <= n; i++) scanf("%lld", &p[i]);
  for (int i = 1; i <= n + 1; i++) {
    dp[i] = 1 + (100 - p[i]) * (1 + s) % mod * inv(p[i]) % mod;
    s = (s + dp[i]) % mod;
  }
  printf("%lld", (s - 1 + mod) % mod);
  return 0;
}
