#include <bits/stdc++.h>
using namespace std;
long long p[200005];
long long c1[200005];
long long c2[200005];
long long r1[200005];
long long r2[200005];
long long pow(long long a, long long n) {
  if (n == 1) return a % 998244353ll;
  long long mid = n / 2;
  long long res = pow(a, mid);
  if (n % 2 == 0)
    return (res * res) % 998244353ll;
  else {
    res = (res * res) % 998244353ll;
    return (res * a) % 998244353ll;
  }
}
int main() {
  long long i, n;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> p[i];
  c1[n] = 100 - p[n];
  c2[n] = 100;
  r1[n] = 1;
  r2[n] = 1;
  for (i = 1; i <= n - 1; i++) {
    c1[n - i] =
        100 * c2[n - i + 1] + p[n - i] * (c1[n - i + 1] - c2[n - i + 1]);
    c2[n - i] = 100 * c2[n - i + 1];
    r1[n - i] = 100 * r2[n - i + 1] + p[n - i] * r1[n - i + 1];
    r2[n - i] = 100 * r2[n - i + 1];
    c1[n - i] = c1[n - i] % 998244353ll;
    c2[n - i] = c2[n - i] % 998244353ll;
    r1[n - i] = r1[n - i] % 998244353ll;
    r2[n - i] = r2[n - i] % 998244353ll;
  }
  long long p = (c2[1] * r1[1]) % 998244353ll;
  long long q = (r2[1] * (c2[1] - c1[1])) % 998244353ll;
  long long result = (p * pow(q, 998244353ll - 2)) % 998244353ll;
  if (result < 0) result += 998244353ll;
  cout << result << endl;
  return 0;
}
