#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 prime[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};

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;
}

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

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 = 1;
	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);
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	vector<array<int, 2>> f(0);
	for (int i = 1; i <= n; i++)
	{
		int x = a[i], w = 0;
		for (int j = 0; j < 16; j++)
		{
			if (x % prime[j] == 0)
				w |= (1ll << j);
			while (x % prime[j] == 0)
				x /= prime[j];
		}
		array<int, 2> res;
		if (x == 1)
			res = {w, a[i]};
		else
			res = {w, a[i] / x * (x - 1)};
		f.push_back(res);
	}
	vector<int> ans(1ll << 16, 0);
	ans[0] = 1;
	for (int i = 0; i < n; i++)
	{
		vector<int> tmp(1ll << 16, 0);
		for (int l = 0; l < (1ll << 16); l++)
		{
			int pos = l | f[i][0];
			tmp[pos] = (tmp[pos] + ans[l] * f[i][1]) % mod;
		}
		for (int l = 0; l < (1ll << 16); l++)
			ans[l] = (ans[l] + tmp[l]) % mod;
	}
	int sum = 0;
	for (int l = 0; l < (1ll << 16); l++)
	{
		int x = l, w = ans[l];
		while (x)
		{
			int pri = prime[(int)log2(lowbit(x))];
			x -= lowbit(x);
			int invp = qpow(pri, mod - 2);
			w = w * invp % mod * (pri - 1) % mod;
		}
		sum = (sum + w) % mod;
	}
	cout << sum;
}

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