#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long inv(long long a) {
  long long r = 1, k = MOD - 2, t = a;
  while (k) {
    if (k & 1) {
      r = (t * r) % MOD;
    }
    t = (t * t) % MOD;
    k = k / 2;
  }
  return r;
}
signed main() {
  long long n;
  cin >> n;
  vector<long long> p(n);
  for (long long i = 0; i < n; i++) {
    cin >> p[i];
    p[i] = (p[i] * inv(100)) % MOD;
  }
  long long a = 1, b = 0;
  for (long long i = 0; i < n; i++) {
    a = a * inv(p[i]) % MOD;
    b = b * inv(p[i]) % MOD;
    a = (a + (p[i] - 1) * inv(p[i])) % MOD;
    b = (b - inv(p[i]) + MOD) % MOD;
  }
  cout << (MOD - b) % MOD << "\n";
  return 0;
}
