#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const double PI = acos(-1.0);
const double eps = 1e-8;
const long long mod = 998244353;
long long fpow(long long a, long long b) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) ans = ans * a % mod;
    b >>= 1;
    a = a * a % mod;
  }
  return ans;
}
int main() {
  std::ios::sync_with_stdio(false);
  long long ans = 0, p, n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> p;
    ans = (ans + 1) % mod;
    ans = ans * 100 % mod * fpow(p, mod - 2) % mod;
  }
  cout << ans << endl;
  return 0;
}
