#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 998244353;
inline int fpow(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % mod;
    a = 1ll * a * a % mod;
    b >>= 1;
  }
  return ret;
}
inline int inv(int a) { return fpow(a, mod - 2); }
inline int add(int a, int b) {
  a += b;
  return a >= mod ? a - mod : a;
}
inline int sub(int a, int b) {
  a -= b;
  return a < 0 ? a + mod : a;
}
inline int mul(long long a, int b) { return a * b % mod; }
const int inv100 = inv(100);
int p[N];
int main(void) {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", p + i);
    p[i] = mul(p[i], inv100);
  }
  int y = p[1], a = sub(1, p[1]), b = 1;
  for (int i = 2; i <= n; i++) {
    a = add(a, mul(sub(1, p[i]), y));
    b = add(b, mul(1, y));
    y = mul(y, p[i]);
  }
  a = sub(1, a);
  b = mul(b, inv(a));
  printf("%d\n", b);
}
