#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ins insert
#define pq priority_queue
#define minele min_element
#define maxele max_element
#define lb lower_bound //first pos >= val
#define ub upper_bound // first pos > val
#define cnt_bit __builtin_popcount
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;


int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

const ll oo = 1e18;
const ll maxN = 1e6;

/* Author : Le Ngoc Bao Anh, 10A5, LQD High School for Gifted Student */

void maximize(int &a, int b) {
    a = max(a, b);
}

void minimize(int &a, int b) {
    a = min(a, b);
}

ll v[maxN], a[maxN], b[maxN];
ll pref[maxN][2];

void solve() {
    ll ans = 0, sum = 0;
    int n; cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) cin >> b[i];
    for(int i = 1; i <= n; i++) {
        ll x = rng() % oo; x++;
        sum ^= x;
        v[i] = x;
    }

    for(int i = 1; i <= n; i++) pref[i][0] = pref[i - 1][0] ^ v[a[i]];
    for(int i = 1; i <= n; i++) pref[i][1] = pref[i - 1][1] ^ v[b[i]];

    for(int i = 1; i <= n; i++) {
        for(int j = i; j <= n; j++) {
            ll x = pref[n][1] ^ pref[j][1];
            x = x ^ pref[i - 1][1];
            x = x ^ pref[j][0] ^ pref[i - 1][0];
            if(x == sum) {
                ans++;
                continue;
            }

            x = pref[n][0] ^ pref[j][0];
            x = x ^ pref[i - 1][0];
            x = x ^ pref[j][1] ^ pref[i - 1][1];
            if(x == sum) {
                ans++;
            }
        }
    }

    cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else
    //online
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}