#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
  cout << x << endl;
  exit(0);
}
const int maxn = 1e6 + 5;
const long long mod = 998244353;
long long fac[maxn], ifac[maxn];
long long modpow(long long, long long);
long long inv(long long);
long long nck(long long, long long);
void build();
void testlib();
int n;
long long res;
long long a[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  build();
  testlib();
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[i] = a[i] * inv(100);
    a[i] %= mod;
  }
  long long suffix = 1;
  for (int i = n - 1; i >= 0; i--) {
    suffix *= a[i];
    suffix %= mod;
    res += inv(suffix);
    res %= mod;
  }
  cout << res << endl;
  return 0;
}
long long modpow(long long x, long long y) {
  x %= mod;
  long long res = 1;
  while (y > 0) {
    if (y % 2 == 1) {
      res *= x;
      res %= mod;
    }
    x = x * x;
    x %= mod;
    y = y / 2;
  }
  return res;
}
long long inv(long long x) {
  assert(x != 0);
  return modpow(x, mod - 2);
}
void build() {
  fac[0] = ifac[0] = 1;
  for (int i = 1; i < maxn; i++) {
    fac[i] = fac[i - 1] * i;
    fac[i] %= mod;
    ifac[i] = inv(fac[i]);
    ifac[i] %= mod;
  }
}
long long nck(long long n, long long k) {
  assert(n >= 0 && k >= 0);
  if (k > n) return 0;
  return (((fac[n] * ifac[k]) % mod) * ifac[n - k]) % mod;
}
void testlib() {
  assert(modpow(1, 1) == 1);
  assert(modpow(4, 2) == 16);
  assert(modpow(2, 5) == 32);
  assert(fac[3] == 6);
  assert(nck(4, 2) == 6);
  assert(nck(10, 2) == 45);
}
