#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long 

const int mod = 998244353;
const int N = 200050;
const int inf = 0x3f3f3f3f3f3f3f3f;

vector<int> minp(N), primes;

void seive(int n) {
    for (int i = 2; i <= n; ++i) {
        if (!minp[i]) {
            minp[i] = i;
            primes.push_back(i);
        }
        for (auto p : primes) {
            if (i * p > n) break;
            minp[i * p] = p;
            if (p == minp[i]) break;
        }
    }
}

int fa[N];

int find(int x) {
    return x == fa[x] ? x : fa[x] = find(fa[x]);
}

void merge(int x, int y) {
    x = find(x), y = find(y);
    if (x != y) fa[x] = y;
}

int ksm(int a, int b) {
    int ans = 1;
    while (b) {
        if (b & 1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }    
    return ans;
}


void solve() {
    int n;
    cin >> n;

    seive(n);

    for (int i = 1; i <= n; ++i) fa[i] = i;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        merge(a[i], i);
    }

    map<int, int> leader;
    for (int i = 1; i <= n; ++i) {
        leader[find(i)]++;
    }

    int two = 0;
    map<int, int> ans;
    for (auto [id, len] : leader) {
        int k = len, t = 0;
        while (k % 2 == 0) t++, k /= 2;
        two = max(two, t);
        k--;
        map<int, int> cnt;
        while (k > 1) {
            int p = minp[k];
            cnt[p]++;
            k /= p;
        }

        for (auto [x, y] : cnt) {
            ans[x] = max(ans[x], y);
        }
    }

    int res = 1;
    for (auto [x, y] : ans) {
        res = res * ksm(x, y) % mod;
    }
    cout << (res + two) % mod << '\n';
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    while(t--) solve();
}