#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

ll n;
ll a[1000005],b[1000005];
vector<int> G[2][1000005];
int group[2][1000005];
int size[2][1000005];
vector<int> gg[2][1000005];
list<int> lis[2][100005];
int dist[2][1000005];
bool used[1000005];

ll extgcd(ll a,ll b,ll& x,ll& y){
	ll d=a;
	if(b!=0LL){
		d=extgcd(b,a%b,y,x);
		y-=(a/b)*x;
	}else{
		x=1;
		y=0;
	}
	return d;
}

ll mod_inverse(ll a,ll m){
	ll x,y;
	extgcd(a,m,x,y);
	return (m+x%m)%m;
}

ll gcd(ll a,ll b){
	if(b==0LL)return a;
	return gcd(b,a%b);
}

void dfs(int v,int div,int s){
	group[div][v]=s;
	size[div][s]++;
	gg[div][s].push_back(v);
	lis[div][s].push_back(v);
	for(int i=0;i<G[div][v].size();i++){
		int nv=G[div][v][i];
		if(group[div][nv]==-1){
			dist[div][nv]=dist[div][v]+1;
			dfs(nv,div,s);
		}
	}
}

int main(void){
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%lld",&a[i]);
		a[i]--;
		G[0][i].push_back(a[i]);
	}
	for(int i=0;i<n;i++){
		scanf("%lld",&b[i]);
		b[i]--;
		G[1][i].push_back(b[i]);
	}
	int cnt=0;
	memset(group,-1,sizeof(group));
	for(int i=0;i<n;i++){
		if(group[0][i]==-1){
			dfs(i,0,cnt++);
		}
	}
	cnt=0;
	for(int i=0;i<n;i++){
		if(group[1][i]==-1){
			dfs(i,1,cnt++);
		}
	}
	ll ans=0;
	for(int i=0;i<n;i++){
		if(used[i])continue;
		int ga=group[0][i];
		used[i]=true;
		int gb=group[1][i];
		int ga_size=gg[0][ga].size();
		int gb_size=gg[1][gb].size();
		vector<ll> vs;
		int gcdval=gcd(ga_size,gb_size);
		if(gcdval==0)while(1);
		ll all=(ll)ga_size*(gb_size/gcdval);
		vs.push_back(0);
		for(int j=0;j<gg[0][ga].size();j++){
			int v=gg[0][ga][j];
			if(used[v])continue;
			if(gb==group[1][v]){
				int dista=dist[0][i]-dist[0][v];
				int distb=dist[1][i]-dist[1][v];
				if(dista<0)dista+=ga_size;
				if(distb<0)distb+=gb_size;
				//printf("%d %d %d %d\n",i,v,dista,distb);
				if(dista==distb){
					used[v]=true;
					vs.push_back(dista);
				}else{
					if(ga_size%gb_size==0)continue;
					int diff=distb-dista;
					diff%=gb_size;
					if(diff<0)diff+=gb_size;
					if(gcd(ga_size,gb_size)!=1){
						if(diff%gcdval!=0)continue;
						diff/=gcdval;
						ll di=mod_inverse(diff,ga_size/gcdval);
						di%=ga_size/gcdval;
						if(di<0LL)di+=ga_size/gcdval;
						vs.push_back((ll)dista+di*(ga_size/gcdval));
						used[v]=true;
					}else{
						ll di=mod_inverse(diff,ga_size);
						di%=ga_size;
						if(di<0LL)di+=ga_size;
						vs.push_back((ll)dista+di*ga_size);
						used[v]=true;
					}
				}
			}
		}
		vs.push_back(all);
		sort(vs.begin(),vs.end());
		for(int j=0;j<(int)vs.size()-1;j++){
			//printf("%d ",vs[j]);
			ll diff=vs[j+1]-vs[j]-1LL;
			ll vac=(diff*(diff+1LL)%MOD)*mod_inverse(2,MOD)%MOD;
			ans+=vac;
			if(ans>=MOD)ans%=MOD;
		}
		//printf("%d\n",vs[vs.size()-1]);
		//printf("get%d %lld\n",i,ans);
	}
	printf("%lld\n",ans);
	return 0;
}