#include<algorithm>
#include<iostream>
#include<utility>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#define int long long
#define PB push_back
#define X first
#define Y second
using namespace std;
const int N=1e5+5,MOD=1e9+7;
int v[N]={},ans1[N]={};
bool vis[N]={};
int n,now,k,sum,ans=1,nowk,nowkk;
signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++) cin>>v[i];
    for(int i=1;i<=n;i++){
        if(vis[i]) continue;
        now=i,k=0,sum=0;
        while(!vis[now]) vis[now]=true,now=v[now],k++;
        while(!(k&1)) sum++,k>>=1;
        nowk=max(nowk,sum);
        if(k>1){
            now=0,nowkk=1,nowkk<<=1,nowkk%=k,now++;
            while(nowkk!=1) nowkk<<=1,nowkk%=k,now++;
            for(int j=2;j<=now;j++){
                sum=0;
                while(!(now%j)) sum++,now/=j;
                ans1[j]=max(ans1[j],sum);
            }
        }
    }
    for(int i=2;i<=n;i++){
        while(ans1[i]) ans*=i,ans%=MOD,ans1[i]--;
    }
    cout<<ans+nowk<<"\n";
    return 0;
}