#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int add(int a, int b) { return (a + b) % MOD; }
int sub(int a, int b) { return (a - b + MOD) % MOD; }
int mul(int a, int b) { return ((long long)a * b) % MOD; }
int inv(int a) {
  int b = 1;
  for (int i = 0; (1 << i) <= (MOD - 2); i++) {
    if ((1 << i) & (MOD - 2)) b = mul(b, a);
    a = mul(a, a);
  }
  return b;
}
const int MAXN = 2e5 + 10;
int a[MAXN], total;
void update(int l, int r, int k) {
  int x = a[r - 1];
  if (l > 0) x = sub(x, a[l - 1]);
  int y = sub(a[r], a[r - 1]);
  int val = mul(x, inv(y));
  if (k == 1)
    total = add(total, val);
  else
    total = sub(total, val);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  a[0] = 1;
  int m = 1;
  for (int i = 0; i < n; i++) {
    int p;
    cin >> p;
    p = mul(p, inv(100));
    m = mul(p, m);
    a[i + 1] = add(a[i], m);
  }
  set<int> s = {0, n};
  update(0, n, 1);
  cout << total << "\n";
  return 0;
}
