#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200 * 1000 + 23, D = 998244353;
int inv(int x) {
  int ret = 1, y = D - 2;
  for (; y; y >>= 1, x = 1ll * x * x % D)
    if (y & 1) ret = 1ll * ret * x % D;
  return ret;
}
int n, p[MAXN], dp[MAXN], f = inv(100);
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> p[i], p[i] = 1ll * p[i] * f % D;
  for (int i = 1; i <= n; i++)
    dp[i] = 1ll * (1 + dp[i - 1]) * inv(p[i - 1]) % D;
  cout << dp[n];
  return 0;
}
