#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
const int N = 2e5 + 10;
int t = 1, n;
int p[20] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int dp[1 << 16];
int qpow(int a, int n)
{
    int res = 1;
    while (n)
    {
        if (n & 1)
            res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res % mod;
}
void solve()
{
    map<int, vector<pair<int, int>>> mp;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        int tmp = a[i];
        int msk = 0;
        for (int i = 0; i < 16; i++)
        {
            if (tmp % p[i] == 0)
            {
                while (tmp % p[i] == 0)
                    tmp /= p[i];
                msk |= 1 << i;
            }
        }
        mp[tmp].push_back({msk, a[i]});
    }
    dp[0] = 1;
    for (auto node : mp)
    {
        int x = node.first;
        auto ve = node.second;
        int lst = max(x - 1, 1ll) % mod * qpow(x, mod - 2);
        for (auto tmp : ve)
        {
            int msk = tmp.first;
            int val = tmp.second;
            for (int i = (1 << 16) - 1; i >= 0; i--)
                dp[i | msk] = (dp[i | msk] + dp[i] * val % mod * lst % mod) % mod;
        }
    }
    int ans = 0;
    for (int i = 0; i < (1 << 16); i++)
    {
        for (int j = 0; j < 16; j++)
        {
            if (i & (1 << j))
                dp[i] = dp[i] * max(p[j] - 1, 1ll) * qpow(p[j], mod - 2) % mod % mod;
        }
        ans = (ans + dp[i]) % mod;
    }
    cout << ans << endl;
    return;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    while (t--)
        solve();
    return 0;
}