#include "bits/stdc++.h"
#define rep(i, a, n) for (auto i = a; i <= (n); ++i)
#define revrep(i, a, n) for (auto i = n; i >= (a); --i)
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a).size()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if (b < a) { a = b; return 1; } return 0; }
using namespace std;

template<class A, class B> string to_string(pair<A, B> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string) s); }
string to_string(char c) { return "'" + string(1, c) + "'"; }
string to_string(bool x) { return x ? "true" : "false"; }
template<class A> string to_string(A v) {
	bool first = 1;
	string res = "{";
	for (const auto &x: v) {
		if (!first) res += ", ";
		first = 0;
		res += to_string(x);
	}
	res += "}";
	return res;
}
template<class A, class B> string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }

void debug_out() { cerr << endl; }
template<class Head, class... Tail> void debug_out(Head H, Tail... T) {
	cerr << " " << to_string(H);
	debug_out(T...);
}
#ifndef ONLINE_JUDGE
	#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
	#define debug(...) if(0) puts("No effect.")
#endif

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;

template<const int &mod> struct Z {
	int x; 
	Z(ll a = 0): x(a % mod) { if (x < 0) x += mod; }
	explicit operator int() const { return x; }

	Z& operator +=(Z b) { x += b.x; if (x >= mod) x -= mod; return * this; }
	Z& operator -=(Z b) { x -= b.x; if (x < 0) x += mod; return * this; }
	Z& operator *=(Z b) { x = 1ll * x * b.x % mod; return * this; }
	friend Z operator +(Z a, Z b) { return a += b; }
	friend Z operator -(Z a, Z b) { return a -= b; }
	friend Z operator *(Z a, Z b) { return a *= b; }

	Z pow(ll k) const {
		Z res = 1, a = *this;
		for (; k; k >>= 1, a = a * a) if (k & 1) res = res * a;
		return res;
	}
	Z& operator /=(Z b) {
		assert(b.x != 0);
		*this = *this * b.pow(mod - 2);
		return *this;
	}
	friend Z operator /(Z a, Z b) { return a /= b; }
	
	friend string to_string(Z a) { return to_string(a.x); }
};

const int mod = 998244353;
using Mint = Z<mod>;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int n; cin >> n;
	vi as(n);
	for (auto &x: as) cin >> x;
	if (n == 1) {
		puts("1");
		return 0;
	} else {
		const int maxn = 100'000;
		vector<Mint> g(maxn + 1);
		vvi facs(maxn + 1);
		rep(i, 1, maxn) g[i] = Mint{26}.pow(i);
		rep(i, 1, maxn) {
			facs[i].push_back(i);
			for (int j = i * 2; j <= maxn; j += i) {
				g[j] -= g[i];
				facs[j].push_back(i);
			}
		}
		vector<Mint> inv(maxn + 1);
		rep(i, 1, maxn) inv[i] = Mint{1} / i;
		// debug(g);

		auto solve = [&](int a, int b) -> Mint {
			auto &fa = facs[a];
			auto &fb = facs[b];
			Mint ans = 0;
			// for (auto i: fa) for (auto j: fb) ans += g[i] * g[j] / max(i, j);
			
			// debug(a, b);
			// debug(fa, fb);
			Mint psa = 0, psb = 0;
			auto ita = fa.begin();
			auto itb = fb.begin();
			while (ita != fa.end() || itb != fb.end()) {
				if (ita != fa.end() && itb != fb.end()) {
					if (*ita <= *itb) {
						ans += g[*ita] * psb * inv[*ita];
						psa += g[*ita];
						ita++;
					} else {
						ans += g[*itb] * psa * inv[*itb];
						psb += g[*itb];
						itb++;
					}
				} else if (ita != fa.end()) {
					ans += g[*ita] * psb * inv[*ita];
					psa += g[*ita];
					ita++;
				} else {
					ans += g[*itb] * psa * inv[*itb];
					psb += g[*itb];
					itb++;
				}
			}
			
			return ans;
		};

		Mint ans = 0;
		rep(i, 0, n - 1) {
			int a = as[i];
			int b = as[(i + 1) % n];
			Mint res = solve(a, b);
			ans += res / Mint{26}.pow(a + b);
		}
		printf("%d\n", (int) ans);
	}
	return 0;
}