#include <iostream>

using namespace std;
typedef long long ll;
ll mod = 998244353;
ll pw(ll a,ll x){
    ll ret = 1;
    while(x){
        if(x&1) (ret *= a) %= mod;
        (a *= a) %= mod; x /= 2;
    }
    return ret;
}

ll a[110];
int main(){
    int i,j,n; cin >> n;
    for(i=0;i<n;i++) cin >> a[i];
    ll ans = 0;
    for(i=0;i<n;i++){
        bool f = true;
        for(j=0;j<n;j++){
            if(j!=i && a[i]==a[j]) f = false;
        }
        if(!f) continue;
        ll val = pw(a[i],mod - 2);
        for(j=0;j<n;j++){
            if(j==i) continue;
            ll y = a[j]*a[j]%mod - a[i]*a[i]%mod + mod;
            y %= mod;
            (val *= pw(y,mod - 2)) %= mod; 
        }
        (ans += val) %= mod;
    }
    cout << ans << endl;
}