#include "bits/stdc++.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
#define int long long

const int MOD = 998244353;
int get(int x){
         if(x == 1) return 1;
         for(int p= 1, j= 2; ; j = j * 2 % x, p++){
                  if(j == 1) return p;
         }
}
int32_t main(){
         cin.tie(0);
         cin.sync_with_stdio(0);

         int n; cin>>n;
         int p[n], vis[n];
         for(int i = 0; i < n; i++){
                  cin>>p[i]; --p[i];
                  ::memset(vis, 0, sizeof vis);
         }
         vector<int> powers(n + 1, 0);
         int mx_tail= 0;
         for(int i = 0; i < n; i++){
                  if(vis[i]) continue;
                  int cur= i, sz= 0;
                  while(!vis[cur]){
                           vis[cur]= 1;
                           sz++;
                           cur= p[cur];
                  }
                  int tail= 0;
                  while(sz % 2 == 0){
                           sz /= 2;
                           tail++;
                  }
                  mx_tail = max(mx_tail, tail);
                  int period= get(sz);
                  for(int j = 2; j <= period; j++){
                           int pw= 0;
                           while(period % j == 0){
                                    period /= j;
                                    pw++;
                           }
                           powers[j]= max(powers[j], pw);
                  }
         }

         int LCM = 1;
         for(int i = 2; i <= n; i++){
                  while(powers[i]--){
                           LCM= LCM * i % MOD;
                  }
         }
         cout<<(LCM + mx_tail) % MOD;
}