#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 998244353;
ll binpow(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b % 2) {
      res = (res * a) % MOD;
    }
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
ll inv(ll a) { return binpow(a, MOD - 2); }
signed main() {
  cin.tie(0);
  cin.sync_with_stdio();
  int n;
  cin >> n;
  vector<int> v(n);
  for (int &i : v) cin >> i;
  ll sol = 0;
  ll prod = 1;
  for (int i = n - 1; i >= 0; i--) {
    ll ex = (100 * inv(v[i])) % MOD;
    ex = (ex * prod) % MOD;
    sol = (sol + ex) % MOD;
    prod = ex;
  }
  cout << sol;
}
