#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) (int)v.size()
#define pb emplace_back
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U>
void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r){
	while(l != r) cout << *l << " ", l++;
	cout << endl;	
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream& operator<<(ostream& o, pair<A, B> p){
	return o << '(' << p.ff << ',' << p.ss << ')';
}

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

	int n;
	cin >> n;

	vector<int> prime, lpf(n + 1, -1);
	for(int i = 2; i <= n; i++){
		if(lpf[i] == -1){
			lpf[i] = i;
			prime.pb(i);
		}
		for(int j : prime){
			if((ll)i * j > n) break;
			lpf[i * j] = j;
			if(j == lpf[i]) break;
		}
	}
	vector<int> ans(n + 1);

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

	vector<bool> vst(n + 1);

	int maxa = 0;
	for(int i = 1; i <= n; i++){
		if(vst[i]) continue;

		int now = i;
		int len = 0;
		while(!vst[now]){
			vst[now] = true;
			len++;
			now = p[now];
		}

		vector<int> tmp(len);
		now = 1;
		int cnt = 0;
		while(!tmp[now]){
			cnt++;
			tmp[now] = cnt;
			now = now * 2 % len;
		}

		int a = tmp[now] - 1;
		maxa = max(maxa, a);
		int b = cnt - tmp[now] + 1;
		while(b > 1){
			int t = lpf[b];
			int c = 0;
			while(b % t == 0){
				c++;
				b /= t;
			}
			ans[t] = max(ans[t], c);
		}
	}

	const ll MOD = 998244353;
	ll total = 1;
	for(int i = 1; i <= n; i++){
		for(int j = 0; j < ans[i]; j++){
			total = total * i % MOD;
		}	
	}
	total += maxa;
	total %= MOD;
	cout << total << "\n";

}