#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1);
void boos() {
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
void file() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
const long long INF = 1e9 + 7;
const long long INF1 = 998244353;
const long long LLINF = (long long)1e18;
const int INTmx = (int)1e9;
const int N = 1e6 + 100;
long long binpow(long long a, long long b) {
  long long ans = 1, k = a;
  while (b) {
    if (b % 2) ans *= k;
    ans %= INF1;
    k *= k;
    k %= INF1;
    b /= 2;
  }
  return ans;
}
long long a[N];
long long cf[N];
int p[N];
int main() {
  boos();
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  cf[n + 1] = 1;
  for (int i = n; i >= 1; i--) {
    cf[i] = (cf[i + 1] * a[i]) % INF1;
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += (binpow(100, n - i + 1) * binpow(cf[i], INF1 - 2)) % INF1;
    ans %= INF1;
  }
  cout << ans;
}
