#include <bits/stdc++.h>
using namespace std;
long long n, p[200005], anw = 0, mul = 1, hd[200005];
const long long mod = 998244353;
long long pw(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a, ret = ret % mod;
    b >>= 1, a = a * a, a = a % mod;
  }
  ret = ret % mod;
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  hd[0] = 1;
  for (int i = 1; i <= n; i++) cin >> p[i], hd[i] = (hd[i - 1] * 100) % mod;
  anw = hd[n];
  for (int i = 1; i < n; i++)
    mul *= p[i], mul %= mod, anw += (mul * hd[n - i]) % mod, anw %= mod;
  mul = mul * p[n], mul %= mod;
  anw *= pw(mul, mod - 2), anw = anw % mod;
  cout << anw;
  return 0;
}
