#include <stdio.h>
#include <string.h>
#include <assert.h>

#include <vector>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

#define eb emplace_back

using namespace std;

typedef long double LDB;

typedef long long LL;
constexpr int N = 32768, PC = 450, M = 3001;
constexpr int mod = 998244353;

int n, a[N], res;
int pid[M], pr[PC], cnt;
bool was[M];
int f[N], g[N];
char pc[N];

constexpr int neg(int x) {
	return x ? mod - x : x;
}

constexpr int inv(int x, int k = mod - 2) {
	int r = 1;
	while (k) {
		if (k & 1) {
			r = x * (LL)r % mod;
		}
		x = x * (LL)x % mod;
		k >>= 1;
	}
	return r;
}

void Add(int &x, int y) {
	if ((x += y) >= mod) {
		x -= mod;
	}
}

void Fav(int &x, int y, int z) {
	x = (x + y * (LL)z) % mod;
}

void sieve() {
	for (int x = 2; x < M; ++x) {
		if (!was[x]) {
			pid[x] = cnt;
			pr[cnt++] = x;
		}
		for (int k = 0; x * pr[k] < M; ++k) {
			was[x * pr[k]] = true;
			if (!(x % pr[k])) {
				break;
			}
		}
	}
}

struct Pair {
	int s, x;
	Pair() {}
	Pair(int _s, int _x) : s(_s), x(_x) {}
};
vector<Pair> ve[PC], emp;

void decomp(int x, int &s, int &k) {
	for (int d = 2; d <= x; ++d) {
		if (x % d) {
			continue;
		}
		while (!(x % d)) {
			x /= d;
		}
		int t = pid[d];
		if (t > 14) {
			assert(k == -1);
			k = t;
		} else {
			s |= 1 << t;
		}
	}
}

int main() {
	sieve();
	scanf("%d", &n);
	for (int i = 0, x; i < n; ++i) {
		scanf("%d", &x);
		int s = 0, k = -1;
		decomp(x, s, k);
		if (~k) {
			ve[k].eb(s, x);
		} else {
			emp.eb(s, x);
		}
	}
	f[0] = 1;
	for (auto [t, x] : emp) {
		for (int s = M - 1; ~s; --s) {
			Fav(f[s | t], f[s], x);
		}
	}
	for (int k = 15; k < cnt; ++k) {
		for (auto [t, x] : ve[k]) {
			for (int s = M - 1; ~s; --s) {
				Fav(g[s | t], g[s], x);
			}
			x -= x / pr[k];
			for (int s = 0; s < M; ++s) {
				Fav(g[s | t], f[s], x);
			}
		}
		for (int s = 0; s < M; ++s) {
			Add(f[s], g[s]);
		}
		memset(g, 0, M << 2);
	}
	for (int s = 0; s < M; ++s) {
		pc[s] = pc[s >> 1] ^ (s & 1);
		int v = f[s];
		if (!v) {
			continue;
		}
		for (int i = 0; i < 15; ++i) {
			if (s >> i & 1) {
				v = v * (LL)(mod + 1ll - inv(pr[i])) % mod;
			}
		}
		Add(res, v);
	}
	printf("%d\n", res);
	return 0;
}