#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 100007;

int add(int a, int b) {
	a += b;
	if (a >= mod) a -= mod;
	return a;
}

int mul(int a, int b) {
	return 1ll * a * b % mod;
}

int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n;
	cin >> n;
	vector <int> p(n);
	for (int i = 0; i < n; ++i) {
		cin >> p[i], --p[i];
	}
	vector <int> cyc;
	vector <bool> vis(n, false);
	for (int i = 0; i < n; ++i) if (!vis[i]) {
		int cnt = 0;
		for (int x = i; !vis[x]; x = p[x]) {
			vis[x] = true, cnt++;
		}
		cyc.pb(cnt);
	}
	int ans = 1, more = 0;
	while (true) {
		bool even = false;
		for (int x : cyc) {
			if (x % 2 == 0) even = true;
		}
		if (!even) {
			break;
		}
		more++;
		vector <int> ncyc;
		for (int x : cyc) {
			if (x % 2 == 0) ncyc.pb(x / 2);
			else ncyc.pb(x);
		}
		cyc = ncyc;
	}

	vector <int> cnt(n + 1), lp(n + 1);
	for (int i = 2; i <= n; ++i) if (!lp[i]) {
		for (int j = i; j <= n; j += i) if (!lp[j]) {
			lp[j] = i;
		}
	}

	for (int x : cyc) {
		int cur = x - 1;
		while (cur > 1) {
			int p = lp[cur];
			int c = 0;
			while (cur % p == 0) {
				cur /= p;
				c++;
			}
			cnt[p] = max(cnt[p], c);
		}
	}

	for (int i = 2; i <= n; ++i) {
		for (int j = 0; j < cnt[i]; ++j) {
			ans = mul(ans, i);
		}
	}

	cout << add(ans, more) << '\n';
}