#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
inline long long fast_mi(long long a, long long b = mod - 2) {
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a % mod;
    }
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
const int maxN = 2e5 + 7;
long long dp[maxN];
int N;
long long p[maxN];
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%lld", &p[i]);
  dp[0] = 0;
  for (int i = 1; i <= N; i++) {
    dp[i] = (dp[i - 1] + 1LL) * 100 % mod * fast_mi(p[i]) % mod;
  }
  printf("%lld\n", dp[N]);
  return 0;
}
