#include<bits/stdc++.h>
#include<atcoder/lazysegtree>
using namespace std;
using namespace atcoder;
const int inf = 1 << 30;

struct S{
    int min;
    int cnt;
};

S op(S l, S r){
    if(l.min == r.min) return S{l.min, l.cnt + r.cnt};
    return (l.min < r.min)? l:r;
}

S e(){
    return S{inf, -1};
}

using F = int;

S mapping(F x, S r){
    return S{x + r.min, r.cnt};
}

F composition(F l, F r){
    return l + r;
}

F id(){
    return 0;
}

void solve(){
    int n;
    cin >> n;
    vector<int> A(n);
    vector<int> B(n);
    for(int i = 0; i < n; i++) cin >> A[i];
    for(int i = 0; i < n; i++) cin >> B[i];
    vector<S> init(n, {0, 1});
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(init);
    long long ans = 0;
    map<int, int> befa;
    map<int, int> befb;
    for(int r = 1; r <= n; r++){
        int a = A[r - 1];
        if(befa[a] < befb[a]) seg.apply(befa[a], befb[a], -1);
        else if(befa[a] > befb[a]) seg.apply(befb[a], befa[a], -1);
        befa[a] = r;
        if(befa[a] < befb[a]) seg.apply(befa[a], befb[a], 1);
        else if(befa[a] > befb[a]) seg.apply(befb[a], befa[a], 1);

        int b = B[r - 1];
        if(befa[b] < befb[b]) seg.apply(befa[b], befb[b], -1);
        else if(befa[b] > befb[b]) seg.apply(befb[b], befa[b], -1);
        befb[b] = r;
        if(befa[b] < befb[b]) seg.apply(befa[b], befb[b], 1);
        else if(befa[b] > befb[b]) seg.apply(befb[b], befa[b], 1);
        S tmp = seg.prod(0, r);
        if(tmp.min == 0) ans += tmp.cnt;
    }
    cout << ans << "\n";
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int t;
    t = 1;
    //cin >> t;
    while(t--) solve();
}