#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 5;
const int mod = 998244353;
int __t = 1, n;
int prime[20] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 1};
int kp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}
void solve() {
    map<int, vector<pair<int, int>>> mp;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        int nd = 0, sum = 1;
        for (int i = 0; i < 16; i++) {
            while (x % prime[i] == 0) {
                x /= prime[i];
                sum = (sum * prime[i]) % mod;
                nd |= (1 << i);
            }
        }
        mp[x].push_back({nd, sum});
    }
    map<int, int, greater<int>> dp;
    dp[0] = 1;
    for (auto [x, vec] : mp) {
        prime[16] = x;
        for (auto [nd, sum] : vec) {
            if (x != 1)
                nd |= 1 << 16;
            for (auto [i, dpi] : dp) {
                int nnd = nd | i;
                dp[nnd] = (dp[nnd] + dpi * sum % mod) % mod;
            }
        }
        vector<int> del;
        for (auto [i, dpi] : dp) {
            if ((i & (1 << 16)) != 0) {
                dp[i ^ (1 << 16)] = (dp[i ^ (1 << 16)] + dpi) % mod;
                del.push_back(i);
            } else
                break;
        }
        for (auto i : del)
            dp.erase(i);
    }
    int sum = 0;
    for (auto [i, dpi] : dp) {
        int x = dpi;
        for (int j = 0; j < 16; j++) {
            if ((i & (1 << j)) != 0) {
                x = x * kp(prime[j], mod - 2) % mod;
                x = x * (prime[j] - 1) % mod;
            }
        }
        sum = (sum + x) % mod;
    }
    cout << sum << '\n';
    return;
}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    // cin >> __t;
    while (__t--)
        solve();
    return 0;
}