#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const long long inf = 0x3f3f3f3f;
const long long INFF = 1e18 + 5;
const long long INF = 1e9;
const long long MX = 2e6 + 5;
const long long MXL = 105;
const long long mod = 998244353;
const double ERROR = 1e-7;
long long modex(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return res;
}
long long inv(long long x) { return modex(x, mod - 2); }
long long n, arr[MX], dp[MX], ans = 0, M = 1, p, q;
void solve() {
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> arr[i];
  for (long long i = n; i >= 1; i--) {
    M = (((M * 100) % mod) * inv(arr[i])) % mod;
    ans = (ans + M) % mod;
  }
  cout << ans % mod << "\n";
}
int32_t main() { solve(); }
