#include <bits/stdc++.h>
const int maxn = 2e5 + 10;
const int maxm = 1e5 + 10;
const long long int mod = 998244353;
const long long int INF = 1e18 + 100;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
const double eps = 1e-8;
using namespace std;
int n, m;
int cas, tol, T;
int p[maxn];
long long int fpow(long long int a, long long int b) {
  long long int ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
int main() {
  long long int M = fpow(100ll, mod - 2);
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
  }
  long long int b = 0, c = 0;
  long long int tmpb = 1;
  for (int i = 1; i <= n; i++) {
    b += tmpb * (100ll - p[i]) % mod * M % mod;
    c += tmpb;
    tmpb *= p[i] * M % mod;
    b %= mod, c %= mod, tmpb %= mod;
  }
  b = mod - b + 1;
  b = (b % mod + mod) % mod;
  long long int ans = c * fpow(b, mod - 2) % mod;
  printf("%lld\n", ans);
  return 0;
}
