#include <iostream>
#include <vector>
#include <tuple>
#include <map>
#include <algorithm>
using namespace std;

long long N, A[100009], B[100009], col1[100009], cnt1[100009], S1[100009], col2[100009], cnt2[100009], S2[100009], cnts1, cnts2;
vector<tuple<long long, long long, long long>>G;
map<tuple<long long, long long, long long>, vector<long long>>M;
map<tuple<long long, long long, long long>, long long>MM;

long long modpow(long long a, long long b, long long mod) {
	long long p = 1, q = a;
	for (long long i = 0; i < 30; i++) {
		if ((b / (1 << i)) % 2 == 1) { p *= q; p %= mod; }
		q *= q; q %= mod;
	}
	return p;
}
long long Div(long long a, long long b, long long mod) {
	return (1LL * a*modpow(b, mod - 2, mod)) % mod;
}

void dfs1(long long pos, long long v) {
	col1[pos] = cnts1; cnt1[pos] = v; S1[cnts1]++;
	if (col1[A[pos]] == 0) { dfs1(A[pos], v + 1); }
}
void dfs2(long long pos, long long v) {
	col2[pos] = cnts2; cnt2[pos] = v; S2[cnts2]++;
	if (col2[B[pos]] == 0) { dfs2(B[pos], v + 1); }
}
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}

int main() {
	cin >> N;
	for (long long i = 1; i <= N; i++) cin >> A[i];
	for (long long i = 1; i <= N; i++) cin >> B[i];
	for (long long i = 1; i <= N; i++) { if (col1[i] == 0) { cnts1++; dfs1(i, 0); } }
	for (long long i = 1; i <= N; i++) { if (col2[i] == 0) { cnts2++; dfs2(i, 0); } }
	for (long long i = 1; i <= N; i++) {
		long long F1 = S1[col1[i]], F2 = S2[col2[i]], K = F1*F2 / gcd(F1, F2), KK = gcd(F1, F2);
		long long T = 1LL * cnt1[i] * (K / F1) + 1LL * cnt2[i] * (K / F2); if (T >= K) T -= K;
		long long U = (cnt1[i] - cnt2[i] + K) % KK;
		long long TT = Div(((K / F1) + (K / F2)) % K, T, K);

		G.push_back(make_tuple(col1[i], col2[i], U));
		M[make_tuple(col1[i], col2[i], U)].push_back(TT);
		MM[make_tuple(col1[i], col2[i], U)] = K;
	}
	sort(G.begin(), G.end()); G.erase(unique(G.begin(), G.end()), G.end());

	long long ans = 0;

	for (long long i = 0; i < G.size(); i++) {
		vector<long long> Z = M[G[i]];
		sort(Z.begin(), Z.end()); long long B = Z[0];
		for (long long j = 0; j < Z.size(); j++) Z[j] -= B;

		for (long long j = 0; j < Z.size(); j++) {
			long long GG = Z[(j + 1) % Z.size()] - Z[j]; if (GG <= 0) GG += MM[G[i]];
			ans += GG * (GG - 1) / 2; ans %= 1000000007;
		}
	}
	cout << ans << endl;
	return 0;
}