#include <bits/stdc++.h>
#pragma GCC optimize "03"
using namespace std;
const long long int N = 2e5 + 5;
const long long int mod = 998244353;
const long long int inf = 1e9 + 9;
long long int p[N], pre[N];
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b >>= 1;
    a = (a * a) % mod;
  }
  return ans;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  p[0] = 1;
  pre[0] = 1;
  long long int ans = 0;
  for (long long int i = 1; i <= n; i++) {
    cin >> p[i];
    p[i] = (100 * power(p[i], mod - 2)) % mod;
    pre[i] = (pre[i - 1] * p[i]) % mod;
    ans = (p[i] + p[i] * ans) % mod;
  }
  cout << ans;
  return 0;
}
