#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int qmul(int a, int b) {
  a = (a % mod + mod) % mod;
  b = (b % mod + mod) % mod;
  int ans = 0;
  while (b) {
    if (b & 1) ans = (ans + a) % mod;
    a = (a << 1) % mod;
    b >>= 1;
  }
  return ans;
}
int qpow(int a, int p) {
  int ans = 1;
  while (p) {
    if (p & 1) ans = qmul(ans, a);
    a = qmul(a, a);
    p >>= 1;
  }
  return ans;
}
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  int n, a, p = 0, q = 1;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a;
    p = qmul((p + q) % mod, 100);
    q = qmul(q, a);
    int r = gcd(p, q);
    p = p / r;
    q = q / r;
  }
  cout << qmul(p, qpow(q, mod - 2)) << endl;
  return 0;
}
