#include <iostream>
#include <utility>
#include <vector>
using LL = long long;
constexpr int N = 1E5;
constexpr int mod = 998244353;
using VPII = std::vector<std::pair<int, int>>;
int P[N + 1]; bool vis[N + 1];
int alp[N + 1], beta[N + 1];
VPII factor(int n)
{
	VPII PF;
	for (int i = 2; i * i <= n; ++i)
		if (!(n % i))
		{
			int a = 0;
			do
				++a, n /= i;
			while (!(n % i));
			PF.emplace_back(i, a);
		}
	if (n > 1)
		PF.emplace_back(n, 1);
	return PF;
}
void chk_max(int& a, int b) { if (a < b) a = b; }
int mul(int a, int b, int m) { return static_cast<LL>(a) * b % m; }
int pow(int b, int e, int m)
{
	int r = 1;
	while (e--) r = mul(r, b, m);
	return r;
}
int main()
{
	std::ios_base::sync_with_stdio(false), std::cin.tie(nullptr);
	int N; std::cin >> N;
	for (int i = 1; i <= N; ++i)
		std::cin >> P[i];
	for (int i = 1; i <= N; ++i)
	{
		if (vis[i]) continue;
		int u = i, cnt = 0;
		do
			u = P[u], vis[u] = true, ++cnt;
		while (u != i);
		for (auto [u, v] : factor(cnt))
			chk_max(alp[u], v);
	}
	for (int i = 1; i <= N; ++i)
	{
		if (!alp[i]) continue;
		int pa = pow(i, alp[i], N + 1);
		int phi = pa - pa / i;
		// 2^phi = 1 mod pa
		int d;
		for (d = 1; d <= phi; ++d)
			if (!(phi % d))
				if (pow(2, d, pa) == 1)
					break;
		for (auto [u, v] : factor(d))
			chk_max(beta[u], v);
	}
	int ans = 1;
	for (int i = 1; i <= N; ++i)
		ans = mul(ans, pow(i, beta[i], mod), mod);
	std::cout << alp[2] + ans << "\n";
}