#include <bits/stdc++.h>
using namespace std;
const int maxn = 200020;
const long long MOD = 998244353LL;
void gcd(long long a, long long b, long long &d, long long &x, long long &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    gcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
long long inv(long long a, long long n) {
  long long d, x, y;
  gcd(a, n, d, x, y);
  return d == 1 ? (x + n) % n : -1;
}
int n;
long long a[maxn], p[maxn], s[maxn];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (int i = 1; i <= n; i++) {
    p[i] = a[i] * inv(100, MOD) % MOD;
  }
  s[0] = 1;
  for (int i = 1; i <= n; i++) s[i] = s[i - 1] * p[i] % MOD;
  long long x = 0, y = 0;
  for (int i = 1; i <= n; i++) {
    x = (x + s[i - 1] * (1 - p[i] + MOD) % MOD) % MOD;
    y = (y + s[i - 1] * (1 - p[i] + MOD) % MOD * i % MOD) % MOD;
  }
  y = (y + s[n] * n % MOD) % MOD;
  x = (1 - x + MOD) % MOD;
  long long res = y * inv(x, MOD) % MOD;
  printf("%lld\n", res);
  return 0;
}
