#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,cnt;
int a[100005],c[100005];
int c2[100005];
ll mod = 998244353;

map <int,int> p;

void dfs(int x) {
    if(c[x]) return;
    cnt++; c[x] = 1;
    dfs(a[x]);
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie();
    cin >> n;
    for(int i = 1;i <= n;i++) {
        cin >> a[i];
    }
    int mx = 0;
    int ans = 1;
    for(int i = 1;i <= n;i++) {
        if(c[i]) continue;
        cnt = 0;
        dfs(i);
        
        int j,g = 1,idx = 0;
        for(j = 1;j <= n;j++) {
            if(c2[idx]) break;
            
            c2[idx] = j;
            idx = (idx+g)%cnt;
            g = g*2%cnt;
        }
        

        int st = c2[idx]-1;
        int re = j-c2[idx];
        int val = re,cn;
        for(int j = 2;j*j <= val;j++) {
            if(val % j == 0) {
                cn = 0;
                while(val % j == 0) {
                    val /= j;
                    cn++;
                }
                p[j] = max(p[j],cn);
            }
        }
        if(val != 1) {
            p[val] = max(p[val],1);
        }
        mx = max(mx,st);
        
        idx = 0; g = 1;
        for(j = 1;j <= cnt;j++) {
            
            
            c2[idx] = 0;
            idx = (idx+g)%cnt;
            g = g*2%cnt;
        }
        
    }
    for(auto &[x,y] : p) {
        for(int i = 0;i < y;i++) {
            //cout << x << '\n';
            ans = ans*x%mod;
        }
    }
    cout << (ans+mx)%mod;
}