#include <bits/stdc++.h>
using namespace std;
long long M = 998244353;
long long power(long long x, long long y) {
  if (y == 0) return 1;
  long long p = power(x, y / 2) % M;
  p = (p * p) % M;
  return (y % 2 == 0) ? p : (x * p) % M;
}
int main() {
  int n;
  cin >> n;
  vector<int> v;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    v.push_back(a);
  }
  for (int i = 0; i < n; ++i) {
    v[i] = (100 * power(v[i], M - 2)) % M;
  }
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    ans = ((ans + 1) * v[i]) % M;
  }
  cout << ans << endl;
  return 0;
}
