#include <bits/stdc++.h>
using namespace std;
const int MX = 4e5, MOD = 998244353;
long long n, p[MX];
long long modpow(long long x_, long long N_) {
  if (N_ == 0) return 1;
  long long a = modpow(x_, N_ / 2);
  a = (a * a) % MOD;
  if (N_ % 2) a = (a * x_) % MOD;
  return a;
}
long long inv(long long x_) { return modpow(x_, MOD - 2); }
long long mod(long long x_) { return (x_ + MOD) % MOD; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = int(0); i < int(n); i++) cin >> p[i];
  long long curAns = 0;
  long long inv100 = inv(100);
  for (int i = int(0); i < int(n); i++) {
    long long succes = mod(p[i] * inv100);
    long long fail = mod((100 - p[i]) * inv100);
    long long added = 1 * inv(succes);
    curAns = mod(curAns * added);
    curAns = mod(curAns + added);
  }
  cout << curAns << endl;
}
