#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
const int N = 2e5 + 2, mod = 998244353;
int n, p[N], inv;
int power(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = res * 1LL * x % mod;
    x = x * 1LL * x % mod;
    y >>= 1;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (int i = (1); i <= (n); ++i) cin >> p[i];
  inv = power(100, mod - 2);
  for (int i = (1); i <= (n); ++i) p[i] = p[i] * 1LL * inv % mod;
  int Y = 1, X = 1;
  for (int i = (1); i <= (n); ++i) {
    X = X * 1LL * p[i] % mod;
    if (i < n) Y = (Y + X) % mod;
  }
  cout << (Y * 1LL * power(X, mod - 2) % mod);
  return 0;
}
