#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int maxn = 2e6 + 10;
long long fz = 0, fm = 1;
long long fast_pow(long long x, long long n) {
  long long r = 1;
  for (; n; n >>= 1, x = x * x % mod)
    if (n & 1) r = r * x % mod;
  return r;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, k;
  cin >> n;
  for (int i = (0); i < (n); ++i) {
    cin >> k;
    fz = (fz + fm) % mod;
    fz = fz * 100 % mod;
    fm = fm * k % mod;
  }
  cout << fz * fast_pow(fm, mod - 2) % mod;
  return 0;
}
