#include <bits/stdc++.h>
using namespace std;
const int D = 998244353, MAXN = 200 * 1000 + 23;
int inv(int x) {
  int ret = 1, y = D - 2;
  for (; y; y >>= 1, x = 1ll * x * x % D)
    if (y & 1) ret = 1ll * ret * x % D;
  return ret;
}
int n, a[MAXN], f = inv(100), ans;
pair<int, int> qw[MAXN];
int main() {
  cin >> n;
  qw[n] = {0, 0};
  for (int i = 0; i < n; i++) cin >> a[i], a[i] = 1ll * a[i] * f % D;
  for (int i = n - 1; ~i; i--)
    qw[i] = {(1ll + 1ll * a[i] * qw[i + 1].first) % D,
             ((1ll - a[i] + D) % D + 1ll * a[i] * qw[i + 1].second % D) % D};
  cout << (1ll * qw[0].first * inv((1 - qw[0].second + D) % D)) % D;
  return 0;
}
