#include <bits/stdc++.h>
using namespace std;
using LL = long long;
LL gcd(LL a, LL b) {
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
LL power(LL x, LL y, LL m) {
  if (y == 0) {
    return 1;
  }
  LL p = power(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
LL modInverse(LL a, LL m) {
  LL g = gcd(a, m);
  if (g != 1) {
    exit(1);
  } else {
    return (power(a, m - 2, m));
  }
}
int n;
int ar[200005];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &ar[i]);
  }
  LL pq = 1;
  LL ans = 0;
  for (int i = 0; i < n; ++i) {
    int mama = 100;
    pq = (pq * mama) % 998244353;
    LL inv = modInverse(ar[i], 998244353);
    pq = (pq * inv) % 998244353;
  }
  ans = (ans + pq) % 998244353;
  for (int i = 0; i < n - 1; ++i) {
    pq = (pq * ar[i]) % 998244353;
    LL inv = modInverse(100, 998244353);
    pq = (pq * inv) % 998244353;
    ans = (ans + pq) % 998244353;
  }
  printf("%lld\n", ans);
  return (0);
}
