#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'

constexpr int maxn = 2e5 + 5;
constexpr int mod = 998244353;
constexpr int r = 1ll << 16;
constexpr int prime[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};

int lowbit(int x) {return x & (-x);}

int qpow(int x, int y)
{
	int res = 1;
	while (y)
	{
		if (y & 1) res = res * x % mod;
		x = x * x % mod;
		y >>= 1;
	}
	return res;
}

void fwt_or(vector<int> &a, bool flag)
{
	int len = (int)a.size();
	for (int i = 2; i <= len; i <<= 1)
		for (int j = 0; j < len; j += i)
			for (int k = 0; k < i / 2; k++)
				if (flag)
				{
					int x = a[j + k], y = (a[j + k] + a[j + k + i / 2]) % mod;
					a[j + k] = x;
					a[j + k + i / 2] = y;
				}
				else
				{
					int x = a[j + k], y = ((mod - a[j + k]) % mod + a[j + k + i / 2]) % mod;
					a[j + k] = x;
					a[j + k + i / 2] = y;
				}
}

void mul_or(vector<int> &a, vector<int> &b)
{
	int len = 1ll << 16;
	// while (len < max((int)a.size(), (int)b.size())) len <<= 1;
	a.resize(len); b.resize(len);
	fwt_or(a, 1); fwt_or(b, 1);
	for (int i = 0; i < len; i++) a[i] = a[i] * b[i] % mod;
	fwt_or(a, 0);
}

void solve()
{
	int n; cin >> n;
	vector<int> a(n + 1, 0);
	vector<array<int, 3> > p(n + 1);
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		int x = a[i];
		p[i][2] = x;
		for (int j = 0; j < 16; j++)
		{
			if (x % prime[j] == 0)
			{
				while (x % prime[j] == 0) x /= prime[j];
				p[i][1] |= (1ll << j);
			}
		}
		p[i][0] = x;
	}

	sort(p.begin() + 1, p.end());
	vector<int> ans(1ll << 16, 0);
	ans[0] = 1;

	for (int i = 1, j = 1; i <= n; i = j)
	{
		while (j <= n && p[i][0] == p[j][0]) ++j;
		vector<int> tmp(1ll << 16, 0);
		tmp[0] = 1;
		for (int k = i; k < j; k++)
		{
			vector<int> tmpx(1ll << 16, 0);
			for (int l = 0; l < r; l++)
			{
				int t = l | p[k][1];
				tmpx[t] = (tmpx[t] + tmp[l] * p[k][2] % mod) % mod;
			}
			for (int l = 0; l < r; l++) tmp[l] = (tmp[l] + tmpx[l]) % mod;
		}
		if (p[i][0] != 1)
		{
			int invp = qpow(p[i][0], mod - 2);
			for (int l = 1; l < r; l++) tmp[l] = tmp[l] * invp % mod * (p[i][0] - 1) % mod;
			tmp[0] = (tmp[0] + (tmp[0] - 1) * invp % mod * (p[i][0] - 1) % mod) % mod;
			tmp[0] = (tmp[0] + 1) % mod;
		}
		mul_or(ans, tmp);
	}

	int res = 0;
	for (int l = 0; l < r; l++)
	{
		int x = l, tmp = ans[l];
		while (x)
		{
			int pri = prime[(int)log2(lowbit(x))];
			x -= lowbit(x);
			int invp = qpow(pri, mod - 2);
			tmp = (tmp * invp % mod * (pri - 1)) % mod;
		}
		res = (res + tmp) % mod;
	}
	cout << res;
}

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