#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n, p[200010], dp[200010], inv[110];
int main() {
  cin >> n;
  inv[1] = 1;
  for (register int i = 2; i <= 100; ++i)
    inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
  for (register int i = 1; i <= n; ++i)
    scanf("%d", &p[i]), dp[i] = 100ll * inv[p[i]] % mod * (dp[i - 1] + 1) % mod;
  printf("%d\n", dp[n]);
  return 0;
}
