#include <iostream>
#include <vector>
#include <map>
#include <random>
#include <array>
#include <algorithm>

using namespace std;

int main()
{
    const int psiz = 5;
    const int mod = 1e9 + 7;
    mt19937 rnd;
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 0; i < n; ++i) cin >> b[i];
    auto all = a;
    sort(all.begin(), all.end());
    all.erase(unique(all.begin(), all.end()), all.end());
    int siz = all.size();
    for (int i = 0; i < n; ++i)
    {
        a[i] = lower_bound(all.begin(), all.end(), a[i]) - all.begin();
        b[i] = lower_bound(all.begin(), all.end(), b[i]) - all.begin();
    }
    vector<vector<long long>> val(psiz, vector<long long> (siz));
    for (int i = 0; i < psiz; ++i) for (int j = 0; j < siz; ++j) val[i][j] = (long long)rnd();
    map<array<long long, psiz>, int> mp;
    array<long long, psiz> now;
    for (int i = 0; i < psiz; ++i) now[i] = 0;
    mp[now] = 1;
    for (int i = 0; i < n - 1; ++i)
    {
        for (int j = 0; j < psiz; ++j) now[j] = now[j] + val[j][a[i]] - val[j][b[i]];
        ++mp[now];
    }
    vector<long long> p2(n);
    p2[0] = 1;
    for (int i = 1; i < n; ++i) p2[i] = (p2[i - 1] * 2LL) % mod;
    long long ans = 0;
    for (auto [key, cnt] : mp)
    {
        if (cnt <= 1) continue;
        ans = (ans + mod + p2[cnt] - cnt - 1) % mod;
    }
    cout << ans << endl;
}