#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 998244353;
ll mod_pow(ll x, ll n) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) res = res * x % MOD;
    x = x * x % MOD;
    n >>= 1;
  }
  return res;
}
int main() {
  int n;
  cin >> n;
  ll res = 0;
  for (int i = 0; i < n; i++) {
    int p;
    cin >> p;
    res = (res + 1) * 100 % MOD;
    res = res * mod_pow(p, MOD - 2) % MOD;
  }
  cout << res << endl;
}
