#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long mod1 = 1e9 + 7;
const int N = 2e5 + 10;
int n;
long long p[N];
long long expo(long long a, long long b) {
  if (b == 0) return 1;
  long long y = expo(a, b / 2);
  long long ans = (y * y) % mod;
  if (b & 1) return (ans * a) % mod;
  return ans;
}
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> p[i];
  long long ans = 0, b = 1;
  for (int i = n - 1; i >= 0; i--) {
    long long a = (100 * expo(p[i], mod - 2)) % mod;
    a = (a * b) % mod;
    ans = (ans + a) % mod;
    b = a;
  }
  cout << ans;
}
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
