#include<bits/stdc++.h>
#ifndef LOCAL
#define endl '\n'
#endif
#define ast cout << "debug" << endl
#define debug(n) cout << #n << " = " << n << endl
#define debugv( v ) for( auto e : v ) cout << e << endl
#define debugm( m ) for( auto [f, s] : m ) cout << f << " : " << s << endl;
using namespace std;
using ll = long long;

const int maxn = 3005;
const ll mod = 998244353;

ll phi[maxn], prime[maxn], cnt;
bool is_prime[maxn];
void getphi() {
  for (int i = 1; i <= maxn; i++) {
    is_prime[i] = 1;
  }
  int cnt = 0;
  is_prime[1] = 0;
  phi[1] = 1;
  for (int i = 2; i <= maxn; i++) {
    if (is_prime[i]) {
      prime[++cnt] = i;
      phi[i] = i - 1;
    }
    for (int j = 1; j <= cnt && i * prime[j] <= maxn; 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;
    ll ans = 1;
    for(int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        ans = (ans + ans * phi[x] % mod) % mod;
    }

    cout << ans << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    ll t = 1;
    // cin >> t;
    getphi();
    while(t--)
        solve();
    #ifdef LOCAL
    system("pause");
    #endif
    return 0;
}