#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long inv(long long v) {
  long long g = MOD, x = 0, y = 1;
  for (long long r = v; r != 0;) {
    long long q = g / r;
    g %= r;
    swap(g, r);
    x -= q * y;
    swap(x, y);
  }
  assert(g == 1);
  assert(y == MOD || y == -MOD);
  return x < 0 ? x + MOD : x;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int N;
  cin >> N;
  vector<int> p(N);
  for (int i = 0; i < N; ++i) {
    cin >> p[i];
  }
  long long den = 1;
  for (int i = 0; i < N; ++i) {
    den = (den * p[i]) % MOD;
  }
  vector<long long> pow100(N + 1);
  pow100[0] = 1;
  for (int i = 1; i <= N; ++i) {
    pow100[i] = (pow100[i - 1] * 100) % MOD;
  }
  long long num = 0;
  long long prod = 1;
  for (int i = 0; i < N; ++i) {
    num = (num + prod * pow100[N - i]) % MOD;
    prod = (prod * p[i]) % MOD;
  }
  long long answer = num * inv(den) % MOD;
  cout << answer << endl;
  return 0;
}
