#include <iostream>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;

#include <atcoder/lazysegtree>
using S = pair<int, int>;  // min, num of min
S op(S l, S r) {
    if (l.first < r.first) return l;
    if (l.first > r.first) return r;
    return {l.first, l.second + r.second};
}
S e() { return {1 << 20, 0}; }
using F = int;
S mapping(F f, S x) { return {x.first + f, x.second}; }
F composition(F f, F g) { return f + g; }
F id() { return 0; }

int main() {
    int N;
    cin >> N;

    vector<vector<tuple<int, int, int>>> updates(N + 1);

    unordered_map<int, pair<vector<int>, vector<int>>> mp;
    for (int i = 0; i < N; ++i) {
        int a;
        cin >> a;
        mp[a].first.push_back(i);
    }
    for (int i = 0; i < N; ++i) {
        int b;
        cin >> b;
        mp[b].second.push_back(i);
    }

    for (const auto &[key, xaxb] : mp) {
        const auto &[xa, xb] = xaxb;
        int ia = 0, ib = 0, l = 0;
        while (ia < int(xa.size()) or ib < int(xb.size())) {
            if (ia == xa.size()) {
                updates[l].emplace_back(xb[ib], N, 1);
                updates[xb[ib] + 1].emplace_back(xb[ib], N, -1);
                ib++;
            } else if (ib == xb.size()) {
                updates[l].emplace_back(xa[ia], N, 1);
                updates[xa[ia] + 1].emplace_back(xa[ia], N, -1);
                ia++;
            } else if (xa[ia] == xb[ib]) {
                l = xa[ia] + 1;
                ia++;
                ib++;
            } else if (xa[ia] < xb[ib]) {
                updates[l].emplace_back(xa[ia], xb[ib], 1);
                updates[xa[ia] + 1].emplace_back(xa[ia], xb[ib], -1);
                l = xa[ia] + 1;
                ia++;
            } else {
                updates[l].emplace_back(xb[ib], xa[ia], 1);
                updates[xb[ib] + 1].emplace_back(xb[ib], xa[ia], -1);
                l = xb[ib] + 1;
                ib++;
            }
        }
    }

    long long ret = 0;
    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> tree(vector<S>(N, S(0, 1)));
    for (int i = 0; i < N; ++i) {
        for (auto [l, r, v] : updates[i]) tree.apply(l, r, v);
        auto pr = tree.prod(i, N);
        if (pr.first == 0) ret += pr.second;
    }
    cout << ret << '\n';
}