#include using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- int N; template class UF { public: vector par,rank; UF() {rank=vector(um,0); for(int i=0;irank[y]) return par[x]=y; rank[x]+=rank[x]==rank[y]; return par[y]=x; } }; UF<200000> uf[2]; int A[2][101010]; int id[2][101010]; vector V[2][101010]; ll mo=1000000007; map,vector> M; ll hoge(vector X,vector Y,vector R) { map rev[2]; int i; FOR(i,X.size()) rev[0][X[i]]=i; FOR(i,Y.size()) rev[1][Y[i]]=i; int g=__gcd(X.size(),Y.size()); map> V; FORR(r,R) { int a=id[0][r]; int b=id[1][r]; int dif=(a-b+Y.size())%g; a=(a+X.size()-dif)%X.size(); ll tmp; for(tmp=b;;tmp+=Y.size()) { if(tmp%X.size()==a) break; } V[dif].push_back(tmp); } ll ret=0; FORR(r,V) { vector vec=r.second; sort(ALL(vec)); vec.push_back(vec[0]+1LL*X.size()*Y.size()/g); FOR(i,vec.size()-1) { ll dif=vec[i+1]-vec[i]; (ret+=dif*(dif-1)/2)%=mo; } } return ret; } void solve() { int i,j,k,l,r,x,y; string s; cin>>N; FOR(j,2) { FOR(i,N) { cin>>A[j][i], A[j][i]--; uf[j](i,A[j][i]); } FOR(i,N) if(uf[j][i]==i) { V[j][i].push_back(i); while(A[j][V[j][i].back()]!=i) { id[j][A[j][V[j][i].back()]]=V[j][i].size(); V[j][i].push_back(A[j][V[j][i].back()]); } } } FOR(i,N) M[{uf[0][i],uf[1][i]}].push_back(i); ll ret=0; FORR(r,M) { (ret+=hoge(V[0][r.first.first],V[1][r.first.second],r.second))%=mo; } cout<