#include <cstdio>
#include <vector>
#include <iostream>

#define LL long long
#define uLL unsigned LL

const int mod = 998244353;
const int mx = 1e5;

int n, m;
int a[mx + 5];

int inv[mx + 5];
int qpow[mx + 5];
int qpow_inv[mx + 5];

int cnt[mx + 5];
int sum[mx + 5];

int mu[mx + 5];
int prime[mx + 5];

bool vis[mx + 5];

std::vector<int> divs[mx + 5];

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

void init() {
	vis[0] = vis[1] = true; mu[1] = 1;
	for (int i = 2; i <= mx; i++) {
		if (!vis[i]) mu[prime[++m] = i] = mod - 1;
		for (int j = 1; j <= m && i * prime[j] <= mx; j++) {
			vis[i * prime[j]] = true;
			if (i % prime[j] == 0) {
				mu[i * prime[j]] = 0; break;
			} else {
				mu[i * prime[j]] = mod - mu[i];
			}
		}
	}
	inv[1] = 1 % mod;
	for (int i = 2; i <= mx; i++)
		inv[i] = (LL)(mod - mod / i) * inv[mod % i] % mod;
	LL inv26 = inv[26]; qpow[0] = qpow_inv[0] = 1 % mod;
	for (int i = 1; i <= mx; i++) {
		qpow[i] = qpow[i - 1] * 26LL % mod;
		qpow_inv[i] = qpow_inv[i - 1] * inv26 % mod;
	}
	for (int i = 1; i <= mx; i++)
		for (int j = i; j <= mx; j += i)
			add(cnt[j], (LL)mu[i] * qpow[j / i] % mod);
	for (int i = 1; i <= mx; i++)
		for (int j = i; j <= mx; j += i)
			add(sum[j], (LL)cnt[i] * inv[i] % mod);
	for (int i = 1; i <= mx; i++)
		for (int j = i; j <= mx; j += i)
			divs[j].push_back(i);
}

int main() {
	init(); std::cin >> n;
	for (int i = 1; i <= n; i++)
		std::cin >> a[i];
	if (n == 1) {
		printf("1\n");
	} else {
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			int j = i % n + 1, nowx = sum[a[i]], nowy = sum[a[j]], now = 0;
			auto itx = divs[a[i]].begin(), ity = divs[a[j]].begin();
			while (itx != divs[a[i]].end() && ity != divs[a[j]].end()) {
				int x = *itx, y = *ity;
				if (x < y) {
					LL xx = (LL)cnt[x] * inv[x] % mod; ++itx;
					add(now, xx * nowy % mod * x % mod); nowx = (nowx - xx + mod) % mod;
				} else {
					LL yy = (LL)cnt[y] * inv[y] % mod; ++ity;
					add(now, yy * nowx % mod * y % mod); nowy = (nowy - yy + mod) % mod;
				}
			}
			add(ans, (LL)now * qpow_inv[a[i]] % mod * qpow_inv[a[j]] % mod);
		}
		printf("%d\n", ans);
	}
	return 0;
}