#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;
pair<ll, ll> diofante(ll a, ll b) {
  if (a == 0) return {0, 1};
  auto t = diofante(b % a, a);
  return {t.second - (b / a) * t.first, t.first};
}
ll modinv(ll x) { return (diofante(x, mod).first % mod + mod) % mod; }
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  vector<ll> a(n);
  ll m100 = modinv(100);
  for (auto& i : a) cin >> i;
  ll et = 1;
  for (auto i : a) et = (((et * i) % mod) * m100) % mod;
  et = modinv(et);
  ll pl = 1;
  ll res = 0;
  for (ll i = 0; i < n; ++i) {
    res = (res + ((((100 - a[i]) * m100 % mod) * pl % mod) * (i + 1) % mod) *
                     et % mod) %
          mod;
    pl = (((pl * a[i]) % mod) * m100) % mod;
  }
  res = (res + n) % mod;
  cout << res << endl;
  return 0;
}
