#include <bits/stdc++.h>
using namespace std;
using cat = long long;
cat mod = 998244353;
cat pw(cat a, cat e) {
  if (e <= 0) return 1;
  cat x = pw(a, e / 2);
  x = x * x % mod;
  if (e & 1) x = x * a % mod;
  return x;
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(10);
  int N;
  cin >> N;
  vector<cat> P(N);
  for (int i = 0; i < N; i++) {
    cat p;
    cin >> p;
    P[i] = pw(100, mod - 2) * p % mod;
  }
  vector<vector<cat> > prod(20, vector<cat>(N + 1, 1));
  for (int i = 0; i < N; i++) prod[0][i] = P[i];
  for (int k = 1; k < 20; k++)
    for (int i = 0; i <= N - (1 << k); i++)
      prod[k][i] = prod[k - 1][i] * prod[k - 1][i + (1 << (k - 1))] % mod;
  vector<vector<cat> > sum(20, vector<cat>(N + 1, 1));
  for (int k = 1; k < 20; k++)
    for (int i = 0; i <= N - (1 << k); i++)
      sum[k][i] =
          (sum[k - 1][i] + sum[k - 1][i + (1 << (k - 1))] * prod[k - 1][i]) %
          mod;
  vector<cat> E_sum(N + 1, 0), E_prod(N + 1, 1);
  for (int i = N - 1; i >= 0; i--) {
    E_sum[0] = (E_sum[0] * P[i] + 1) % mod;
    E_prod[0] = (E_prod[0] * P[i]) % mod;
  }
  cat E = E_sum[0] * pw(E_prod[0], mod - 2) % mod;
  cout << E << "\n";
  return 0;
}
