#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[200005],p[200005],ss[105],ans;
ll sum[105][200005],P=998244353;
int n;
ll fp(ll a,ll b){
	a%=P;
	ll c=1;
	while(b){
		if(b&1)c=c*a%P;
		a=a*a%P;
		b/=2;
	}
	return c;
}
int main(){
	cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>p[i];
	}
	for(int i=0;i<=100;i++){
		ss[i]=1ll*i*fp(100,P-2)%P;
	}
	for(int i=1;i<=n;i++){
		dp[i]=(sum[p[i]][i]+1)*fp(ss[100-p[i]],P-2)%P;
		//cout<<fp(ss[100-p[i]],P-2)<<endl; 
		for(int j=0;j<100;j++){
			sum[j][i+1]=(sum[j][i]+dp[i]*ss[j]%P)*ss[j]%P;
		}
		(ans+=dp[i])%=P;
	}
	cout<<ans;
}