#include <bits/stdc++.h>
using namespace std;
const double PI = atan(1.0) * 4;
const int64_t INF = 100000000000000003;
const int32_t LOG = 21;
const long long int MOD = 998244353;
long long int power(long long int x, long long int y) {
  if (y == 0) return 1;
  long long int mul = power(x, y / 2);
  mul = (mul * mul) % MOD;
  if (y & 1) mul = (mul * x) % MOD;
  return mul;
}
long long int inv(long long int x) { return power(x, MOD - 2); }
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  long long int mul = 1;
  long long int ans = 0;
  for (long long int i = n - 1; i >= 0; i--) {
    mul = (mul * (inv(a[i]))) % MOD;
    mul = (mul * 100) % MOD;
    ans += mul;
    if (ans >= MOD) ans -= MOD;
  }
  cout << ans << '\n';
  return 0;
}
