#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long quick_pow(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % mod;
    a = a * a % mod;
    b = b / 2;
  }
  return ret % mod;
}
const int MAXN = 2e6 + 100;
long long a[MAXN];
int main() {
  int n;
  scanf("%d", &n);
  long long cnt = 0;
  for (int i = 1; i <= n; i++) {
    cin >> cnt;
    a[i] = (a[i - 1] + 1) * 100 % mod * quick_pow(cnt, mod - 2) % mod;
  }
  cout << a[n] << endl;
  return 0;
}
