#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = (int)998244353;
const int N = (int)2e5 + 7;
int n, p[N];
inline int add(int a, int b) { return (a += b) >= MOD ? a - MOD : a; }
inline int mul(int a, int b) { return 1ll * a * b % MOD; }
int qpow(long long a, long long b) {
  int r = 1;
  for (a %= MOD; b; a = a * a % MOD, b >>= 1)
    if (b & 1) r = 1ll * r * a % MOD;
  return r;
}
void Init() {
  for (int i = (1); i < (n + 1); ++i) scanf("%d", p + i);
  for (int i = (1); i < (n + 1); ++i) p[i] = mul(p[i], qpow(100, MOD - 2));
}
int Solve() {
  int pre = 0, ans;
  for (int i = (1); i < (n + 1); ++i) {
    ans = mul(add(pre, 1), qpow(p[i], MOD - 2));
    pre = ans;
  }
  return printf("%d\n", ans);
}
int main() {
  while (~scanf("%d", &n)) {
    Init();
    Solve();
  }
  return 0;
}
