#include <bits/stdc++.h>

using namespace std; const int maxn = 1e5 + 5, mod = 998244353; typedef long long ll;

int n, a[maxn];

vector<pair<int, int> > D[maxn];

int inv[maxn], p26[maxn];

int main()
{
    scanf("%d", &n);
    if (n == 1) return 0 * puts("1");
    for (int i = 1; i <= n; i++) scanf("%d", a + i);
    for (int i = 1; i < maxn; i++) for (int j = i; j < maxn; j += i) D[j].push_back({ i, 0 });
    for (int i = (inv[1] = 1) + 1; i < maxn; i++) inv[i] = (ll)(mod - mod / i) * inv[mod % i] % mod;
    // cerr << inv[2] << ' ' << inv[3] << endl;
    for (int i = p26[0] = 1; i < maxn; i++) p26[i] = (ll)p26[i - 1] * inv[26] % mod;
    for (int i = 1, A; i < maxn; i++)
    {
        for (auto &e : D[i]) e.second = p26[i - e.first];
        for (auto e : D[i]) for (auto &E : D[i]) if (E.first != e.first && E.first % e.first == 0) E.second = (E.second - e.second) % mod;
        int s = 0;
        for (auto e : D[i]) s = (s + e.second) % mod;
        // if ((s - 1) % mod != 0)
        // {
        //     cerr << i << endl;
        //     cerr << s << endl;
        // }
        // assert((s - 1) % mod == 0);
    }
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        int A = a[i], B = a[i % n + 1], C = 0, E = 0;
        // cerr << A << ' ' << B << endl;
        auto x = D[A].begin(), y = D[B].begin();
        for (; x != D[A].end() || y != D[B].end(); )
        {
            if (y == D[B].end() || (x != D[A].end() && x->first <= y->first))
            {
                ans = (ans + (ll)C * inv[x->first] % mod * x->second) % mod;
                E = (E + x->second) % mod;
                x++;
            }
            else
            {
                ans = (ans + (ll)E * inv[y->first] % mod * y->second) % mod;
                C = (C + y->second) % mod;
                y++;
            }
        }
    }
    return 0 * printf("%d\n", (ans + mod) % mod);
}