#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define endl '\n'
const ll inf = 1e17;
const ll mod = 998244353;

ll phi(ll x) {
    ll result = 0;
    for (ll i = 1; i <= x; ++i)
        if (gcd(x, i) == 1)
            ++result;
    return result;
}

void oper(ll testcase) {
    ll n = 0;
    cin >> n;
    vector<ll> a(n);
    for (ll i = 0; i < n; ++i)
        cin >> a[i];
    vector<ll> phi_a(n);
    for (ll i = 0; i < n; ++i)
        phi_a[i] = phi(a[i]);
    vector<vector<ll>> results(n + 1, vector<ll>(n + 1));
    for (ll j = 0; j <= n; ++j)
        results[0][j] = 1;
    for (ll i = 1; i <= n; ++i)
        for (ll j = 1; j <= n; ++j)
            results[i][j] = (results[i - 1][j] + results[i - 1][j - 1] * phi_a[i - 1]) % mod;
    cout << results[n][n] << '\n';
}

int main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    cout<<fixed<<setprecision(2);
    ll ttt = 1;
    // cin >> ttt;
    for (ll i = 1; i <= ttt; i++) {
        oper(i);
    }
}