#include <bits/stdc++.h>
using namespace std;

#define Task "MinMax"
#define sp " "
#define endl "\n"
#define int long long
#define sz(x) (int)x.size()

constexpr int maxn = 2e5 + 5;

int n, cnt = 0;
int a[maxn], b[maxn];

int f[maxn][20];
int g[maxn][20];

void Preprocess() {
    for(int i = 1; i <= 17; i++) {
        for(int u = 1; u <= n - (1 << (i - 1)) + 1; u++) {
            f[u][i] = min(f[u][i - 1], f[u + (1 << (i - 1))][i - 1]);
            g[u][i] = max(g[u][i - 1], g[u + (1 << (i - 1))][i - 1]);
        }
    }
}

int GetMax(int l, int r) {
    int k = log2(r - l + 1);
    return max(g[l][k], g[r - (1 << k) + 1][k]);
}

int GetMin(int l, int r) {
    int k = log2(r - l + 1);
    return min(f[l][k], f[r - (1 << k) + 1][k]);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }

    cin >> n;

    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        g[i][0] = a[i];
    }

    for(int i = 1; i <= n; i++) {
        cin >> b[i];
        f[i][0] = b[i];
    }

    Preprocess();

    for(int l = 1; l <= n; l++) {
        int r1 = -1, r2 = -1;

        int low = l, high = n;
        while(low <= high) {
            int mid = low + (high - low) / 2;
            if(GetMax(l, mid) >= GetMin(l, mid)) {
                r1 = mid;
                high = mid - 1;
            }
            else {
                low = mid + 1;
            }
        }

        low = l, high = n;
        while(low <= high) {
            int mid = low + (high - low) / 2;
            if(GetMax(l, mid) > GetMin(l, mid)) {
                r2 = mid;
                high = mid - 1;
            }
            else {
                low = mid + 1;
            }
        }

        if(r1 != -1) {
            if(GetMax(l, r1) == GetMin(l, r1)) {
                if (r2 == -1) {
                    cnt += (n - r1 + 1);
                }
                else {
                    cnt += (r2 - r1);
                }
            }
        }
    }

    cout << cnt << endl;

    return 0;
}