#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 4e5 + 10;
const long long mod = 998244353;
long long a[N], dp[N];
void ex_gcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1, y = 0;
    return;
  }
  ex_gcd(b, a % b, x, y);
  long long t = x;
  x = y;
  y = t - (a / b) * y;
}
long long inv(long long a, long long p) {
  long long inv_a, y;
  ex_gcd(a, p, inv_a, y);
  return (inv_a % p + p) % p;
}
int main() {
  long long n;
  cin >> n;
  long long t = inv(100, mod);
  long long ans = 0;
  for (register int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] = t * a[i] % mod;
  }
  dp[1] = 0;
  for (register int i = 2; i <= n + 1; i++) {
    dp[i] = (dp[i - 1] + 1) * inv(a[i - 1], mod) % mod;
  }
  cout << dp[n + 1] << endl;
  return 0;
}
