#include<bits/stdc++.h>
#define ll long long
#define db double
#define tp ll
#define ptp pair<tp,tp>
#define pdb pair<db,db>
#define umap unordered_map
#define P 998244353ll
#define ed '\n'

using namespace std;

tp n, m;
struct shuzi {
    tp x;
    tp mapri;
};
vector<shuzi>a;
vector<tp>pri;
umap<tp, tp>prid;
vector<tp>dp;

void prime_init(tp n, vector<tp>& prime) {
    vector<tp>not_prime(n + 5);
    for (int i = 2; i <= n; ++i) {
        if (!not_prime[i]) {
            prime.push_back(i);
        }
        for (int pri_j : prime) {
            if (i * pri_j > n) break;
            not_prime[i * pri_j] = true;
            if (i % pri_j == 0) {
                break;
            }
        }
    }
}

tp ksm(tp a, tp b) {
    tp lsans = 1;
    while (b) {
        if (b & 1ll) {
            lsans = (lsans * a) % P;
        }
        a = (a * a) % P;
        b >>= 1;
    }
    return lsans;
}

void init() {
    prime_init(3000, pri);
    tp tot = 0;
    for (auto& it : pri) {
        if (it <= 50) {
            prid[it] = tot;
            ++tot;
        }
        else {
            prid[it] = tot;
        }
    }
}

void clear() {
    a = vector<shuzi>(n + 5);
    dp = vector<tp>((1ll << 16));
}

void solve() {
    cin >> n;
    clear();
    for (tp i = 1; i <= n; i++) {
        cin >> a[i].x;
        for (auto& it : pri) {
            if (it <= 50) {
                continue;
            }
            if (a[i].x % it == 0) {
                a[i].mapri = it;
            }
        }
    }
    sort(a.begin() + 1, a.begin() + n + 1, [](const shuzi& x, const shuzi& y) {
        return x.mapri < y.mapri;
    });
    dp[0] = 1;
    for (tp i = 1; i <= n; i++) {
        if (a[i].mapri != a[i - 1].mapri) {
            if (a[i - 1].mapri != 0) {
                tp tmp = a[i - 1].mapri;
                for (tp j = (1ll << 15); j < (1ll << 16); j++) {
                    dp[j ^ (1ll << 15)] = (dp[j ^ (1ll << 15)] + dp[j] * (1 - ksm(tmp, P - 2) + P)) % P;//乘上1-1/tmp
                    dp[j] = 0;
                }
            }
        }
        tp ad = 0;
        for (auto& it : pri) {
            if (a[i].x < it) {
                break;
            }
            if (a[i].x % it == 0) {
                ad += (1ll << prid[it]);
            }
        }
        for (tp j = (1ll << 16) - 1; j >= 0; j--) {
            dp[j | ad] = (dp[j | ad] + dp[j] * a[i].x) % P;
        }
    }
    if (a[n].mapri != 0) {
        tp tmp = a[n].mapri;
        for (tp j = (1ll << 15); j < (1ll << 16); j++) {
            dp[j ^ (1ll << 15)] = (dp[j ^ (1ll << 15)] + dp[j] * (1 - ksm(tmp, P - 2) + P)) % P;//乘上1-1/tmp
            dp[j] = 0;
        }
    }
    tp ans = 0;
    for (tp i = 0; i < (1ll << 15); i++) {
        tp cnt = dp[i];
        for (tp j = 0; j < 15; j++) {
            if (i & (1ll << j)) {
                cnt = (cnt * (1 - ksm(pri[j], P - 2) + P)) % P;
            }
        }
        ans += cnt;
    }
    cout << ans << ed;



}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    init();
    int _t = 1;
    //cin >> _t;
    while (_t--) {
        solve();
    }
}
/*

3
1 2 3





*/