#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

#define el '\n'
#define F first
#define S second

typedef long long ll;
typedef long double ld;
typedef __int128 bigInt;

using namespace std;

const int N = 1e5 + 5, INF = 1e9 + 5, mod = 998244353, LOG = 21, SQ = 500;

int n, p[N], mx[N];

int solve(int cnt) {
    if (cnt == 1) {
        return 1;
    }

    int cur = 1, ret = 0;

    do {
        cur = (cur * 2) % cnt;
        ret++;
    } while (cur % cnt != 1);

    return ret;
}

void doWork() {
    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> p[i];
    }

    vector<bool> vis(n + 1, 0);

    int mxStart = 0;

    for (int i = 1; i <= n; i++) {
        if (vis[i]) {
            continue;
        }

        vis[i] = 1;

        int cnt = 1, cur = i;

        while (!vis[p[cur]]) {
            cnt++;
            cur = p[cur];
            vis[cur] = 1;
        }

        int curStart = 0;

        while (cnt % 2 == 0) {
            curStart++;
            cnt >>= 1;
        }

        mxStart = max(mxStart, curStart);

        int iterations = solve(cnt);

        for (int j = 2; 1LL * j * j <= iterations; j++) {
            int f = 0;
            while (iterations % j == 0) {
                f++;
                iterations /= j;
            }
            mx[j] = max(mx[j], f);
        }

        if (iterations > 1) {
            mx[iterations] = max(mx[iterations], 1);
        }
    }

    int ans = 1;

    for (int i = 2; i <= n; i++) {
        while (mx[i]--) {
            ans = 1LL * ans * i % mod;
        }
    }

    ans = (ans + mxStart) % mod;

    cout << ans << el;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int tests = 1;
//    cin >> tests;
    for (int i = 1; i <= tests; i++) {
        doWork();
    }
}