#include <bits/stdc++.h>
using namespace std;
#define int long long
struct DisjointSet{
	vector<int>parent,sz;
	int size;
	void init(int n){
		size = n;
		parent.resize(n+1); sz.resize(n+1);
		for(int i = 1; i<=n; i++){
			parent[i] = i;
			sz[i] = 1;
		}
	}
	int find(int x){
		if(parent[x]==x)return x;
		return find(parent[x]);
	}
	void Union(int x, int y){
		x = find(x); y = find(y);
		if(x==y)return;
		if(sz[x]<sz[y]){
			parent[x] = y;
			sz[y]+=sz[x];
		}
		else{
			parent[y] = x;
			sz[x]+=sz[y];
		}
	}
};
const int mod = 998244353;
const int mxn = 100005;
const int N = 1e5 + 9;
int phi[N];
void totient() {
  for (int i = 1; i < N; i++) phi[i] = i;
  for (int i = 2; i < N; i++) {
    if (phi[i] == i) {
      for (int j = i; j < N; j += i) phi[j] -= phi[j] / i;
    }
  }
}
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	totient();
	int n;
	cin >> n;
	vector<int>a(n+1);
	for(int i = 1; i<=n; i++){
		cin >> a[i];
	}
	DisjointSet ds;
	ds.init(n+1);
	for(int i = 1; i<=n; i++){
		ds.Union(a[i],i);
	}
	set<int>s;
	for(int i = 1; i<=n; i++){
		s.insert(ds.find(i));
	}
	vector<int>factor(mxn);
	vector<int>mx(mxn);
	for(int i = 2; i<mxn; i++){
		for(int j = i; j<mxn; j+=i){
			if(!factor[j])factor[j] = i;
			mx[j] = i;
		}
	}
	vector<int>vals;
	int extra = 0;
	vector<int>dp(mxn);
	for(int nxt: s){
		map<int,int>hm;
		int k = ds.sz[nxt];
		if(k==1){
			continue;
		}
			int cnt = 0;
			while(k>1 && k%2==0){
				k/=2;
				cnt++;
			}
			extra = max(extra,cnt);
		
			k = phi[k];
			while(k>1){
				hm[factor[k]]++;
				k/=factor[k];
			}
			for(auto [a,b]: hm){
				dp[a] = max(dp[a],b);
			}
	}
	int ans = 1;
	for(int i = 1; i<mxn; i++){
		for(int j = 0; j<dp[i]; j++){
			ans*=i;
			ans%=mod;
		}
	}
	ans+=extra;
	ans%=mod;
	cout << ans << '\n';

	return 0;
}