#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b, long long m = 998244353) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % m;
    a = (a * a) % m;
    b = b >> 1;
  }
  return ans;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  vector<long long> a(n + 1), pm(n), inv100(n + 1);
  pm[0] = 1;
  inv100[0] = 1;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 1; i <= n; i++) pm[i] = (pm[i - 1] * a[i]) % 998244353;
  long long inv_100 = power(100, 998244353 - 2, 998244353);
  for (long long i = 1; i <= n; i++)
    inv100[i] = (inv100[i - 1] * inv_100) % 998244353;
  long long lhs = 0, rhs = 0;
  for (long long i = 1; i <= n; i++) {
    long long temp =
        (((pm[i - 1] * inv100[i]) % 998244353) * (100 - a[i])) % 998244353;
    rhs += (temp * i) % 998244353;
    rhs %= 998244353;
    lhs += temp;
    lhs %= 998244353;
  }
  rhs += (((pm[n] * inv100[n]) % 998244353) * n) % 998244353;
  rhs %= 998244353;
  lhs = (998244353 + 1 - lhs) % 998244353;
  long long inv_lhs = power(lhs, 998244353 - 2, 998244353);
  long long ans = (rhs * inv_lhs) % 998244353;
  cout << ans;
}
