#include <bits/stdc++.h>
using namespace std;
const long long M = 998244353;
pair<long long, long long> p[200005];
long long modPow(int a, int b) {
  if (b == 0) {
    return 1 % M;
  } else if (b == 1) {
    return a % M;
  } else if (b % 2 == 0) {
    long long temp = modPow(a, b >> 1);
    return (temp * temp) % M;
  } else {
    long long temp = modPow(a, b >> 1);
    return (((temp * temp) % M) * a) % M;
  }
}
int main() {
  int N;
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    int temp;
    scanf("%d", &temp);
    p[i] = pair<long long, long long>(temp, 100);
  }
  pair<long long, long long> p_success = pair<long long, long long>(1, 1);
  for (int i = 0; i < N; i++) {
    p_success = pair<long long, long long>((p_success.first * p[i].first) % M,
                                           p_success.second * p[i].second % M);
  }
  pair<long long, long long> expected_fail = pair<long long, long long>(0, 1);
  long long numerator = 1;
  for (int i = 0; i < N; i++) {
    expected_fail = pair<long long, long long>(
        expected_fail.first, (expected_fail.second * p[i].second) % M);
    numerator = (numerator * p[i].first) % M;
  }
  for (int i = N - 1; i >= 0; i--) {
    if (p[i].first == p[i].second) {
      continue;
    }
    numerator = ((numerator * (p[i].second - p[i].first)) % M *
                 modPow(p[i].first, M - 2)) %
                M;
    expected_fail = pair<long long, long long>(
        (expected_fail.first + (numerator * (i + 1) % M)) % M,
        expected_fail.second);
    numerator = ((numerator * (p[i].second)) % M *
                 modPow(p[i].second - p[i].first, M - 2)) %
                M;
  }
  pair<long long, long long> expected_total =
      pair<long long, long long>((expected_fail.first * p_success.second) % M,
                                 (expected_fail.second * p_success.first) % M);
  pair<long long, long long> total = pair<long long, long long>(
      (expected_total.first + (N * expected_total.second) % M) % M,
      expected_total.second);
  printf("%lld", total.first * modPow(total.second, M - 2) % M);
  return 0;
}
