#include<bits/stdc++.h>
using namespace std;
#define int long long
const long long mod = 998244353;
const int N = 3000 + 20;
long long phi[N],prime[N];
bool is_prime[N];
void phi_table() 
{
    int n = 3000;
    memset(is_prime, 1, sizeof(is_prime));
    int cnt = 0;
    is_prime[1] = 0;
    phi[1] = 1;
    for (int i = 2; i <= n; i++) 
    {
        if (is_prime[i]) 
        {
            prime[++cnt] = i;
            phi[i] = i - 1;
        }
        for (int j = 1; j <= cnt && i * prime[j] <= n; j++) 
        {
            is_prime[i * prime[j]] = 0;
            if (i % prime[j])
                phi[i * prime[j]] = phi[i] * phi[prime[j]];
            else 
            {
                phi[i * prime[j]] = phi[i] * prime[j];
                break;
            }
        }
    }
}
void solve()
{
    int n;
    cin>>n;
    long long ans = 1;
    for(int i = 1;i <= n;i ++){
        long long x;
        cin>>x;
        ans = ans * (1 + phi[x]) % mod;
    }
    cout<<ans<<"\n";
}

signed main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    phi_table();
    solve();
}
// 4
// 4
// #..#
// .##.
// 5
// ##.#.
// .#.##
// 6
// ######
// .####.
// 27
// .######.######.####.#.#####
// .####...####..#.......#####