#include <bits/stdc++.h>
using namespace std;
const int MX = 1000000;
const long long inf = 1e9;
const long long mod = 998244353;
int p[MX];
long long bigmod(long long b, long long p) {
  long long ans = 1;
  for (; p; p >>= 1) {
    if (p & 1) ans = ans * b % mod;
    b = b * b % mod;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> p[i];
  long long days = 0, cur = 1, MI = bigmod(100, mod - 2);
  for (int i = 1; i <= n; i++) {
    days += cur;
    days %= mod;
    cur *= p[i];
    cur %= mod;
    cur *= MI;
    cur %= mod;
  }
  days *= bigmod(cur, mod - 2);
  days %= mod;
  cout << days << endl;
  return 0;
}
