#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 5;
const long long mod = 998244353;
int n, p[maxn];
long long pre[maxn];
long long quick(long long a, long long n) {
  long long ans = 1;
  for (; n; n >>= 1, a = a * a % mod)
    if (n & 1) ans = ans * a % mod;
  return ans;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> p[i];
  pre[0] = 1;
  for (int i = 1; i <= n; i++) {
    pre[i] = pre[i - 1] * p[i] % mod;
  }
  long long tmp = 100, up = 0;
  for (int i = n - 1; i >= 0; i--) {
    up += pre[i] * tmp % mod;
    up %= mod;
    tmp = tmp * 100 % mod;
  }
  cout << up * quick(pre[n], mod - 2) % mod << endl;
  return 0;
}
