#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int pw(int a, int b) {
  int res = 1;
  for (; b; b >>= 1, a = 1LL * a * a % mod)
    if (b & 1) res = 1LL * res * a % mod;
  return res;
}
int n, p[200005], dp[200005];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
    p[i] = 1LL * p[i] * pw(100, mod - 2) % mod;
  }
  for (int i = 2; i <= n + 1; i++) {
    dp[i] = 1LL * pw(p[i - 1], mod - 2) * (dp[i - 1] + 1) % mod;
  }
  printf("%d\n", dp[n + 1]);
  return 0;
}
