#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100, mod = 998244353;
int p[maxn];
int power(int a, int b) {
  if (b == 0) return 1;
  int t = power(a, b >> 1LL);
  t = (1LL * t * t) % mod;
  if (b & 1LL) t = (1LL * t * a) % mod;
  return t;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> p[i];
  int ans = 0, tmp = 1;
  for (int i = n - 1; i >= 0; i--) {
    tmp = (1LL * tmp * 100) % mod;
    tmp = (1LL * tmp * power(p[i], mod - 2)) % mod;
    ans = (ans + tmp) % mod;
  }
  cout << ans << endl;
  return 0;
}
