#include <bits/stdc++.h>
using namespace std;
const long long int inf = 1e18, M = 998244353;
const long long int N = 1;
long long int pw(long long int x, long long int n) {
  long long int res = 1;
  x %= M;
  for (; n; n /= 2) {
    if (n % 2) res = (res * x) % M;
    x = (x * x) % M;
  }
  return res;
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> v(n);
  for (long long int i = 0; i < n; ++i) cin >> v[i];
  long long int num, den, cur, prev = 1, ans = 0;
  for (long long int i = n - 1; i >= 0; --i) {
    num = 100, den = v[i];
    cur = (num % M * pw(den, M - 2) % M) % M;
    cur = (cur % M * prev % M) % M;
    ans = (ans % M + cur % M) % M;
    prev = cur;
  }
  cout << ans;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
