#include <bits/stdc++.h>   using namespace std;   const long long int MOD = 998244353;   long long int power(long long int x, unsigned long long int y) {     long long res = 1, m = y + 2;     x %= m;     while (y > 0) {       if (y & 1) res = res * x % m;       x = x * x % m;       y >>= 1;     }     return res;   }   long long int modInverse(long long int a, long long int m = MOD) {     return power(a, m - 2);   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     long long int t = 1;     while (t--) {       long long int n, i, j;       cin >> n;       long long int a[n];       for (i = 0; i < n; i++) cin >> a[i];       long long int p[n + 1];       p[0] = 1;       for (i = 1; i < n + 1; i++) {         p[i] = 100 * p[i - 1] % MOD;       }       long long int dp[n], x = 1;       for (i = 0; i < n; i++) {         dp[i] = x * (100 - a[i]) % MOD;         x *= a[i];         x %= MOD;         dp[i] *= p[n - i - 1];         dp[i] %= MOD;       }       long long int dp1[n];       for (i = 0; i < n; i++) dp1[i] = dp[i] * (i + 1) % MOD;       long long int s1 = n;       for (i = 0; i < n; i++) s1 *= a[i], s1 %= MOD;       long long int s2 = 0;       for (i = 0; i < n; i++) s2 += dp1[i], s2 %= MOD;       long long int s3 = 0;       for (i = 0; i < n; i++) s3 += dp[i], s3 %= MOD;       s3 = p[n] - s3;       while (s3 < 0) s3 += MOD;       s2 += s1;       s2 %= MOD;       cout << s2 * modInverse(s3) % MOD;     }     cerr <<  Time Taken:  << (float)clock() / CLOCKS_PER_SEC * 1000 <<  ms           <<   n ;     return 0;   }   