#include<bits/stdc++.h>

using namespace std;

const int N=4e5+;

int n;

typedef long long ll;

ll ans;

int a[N][],q[N][],s[];

ll calc(int pos,int v,int l,int r,int k)

{

    int L=,R=s[k],mid,ans=1e9;

    while(L<=R)

    {

        mid=L+R>>;

        if(a[q[mid][k]][k]==v) {ans=mid;break;}

        if(a[q[mid][k]][k]>v) L=mid+;

        else R=mid-;

    }

    if(ans==1e9) return ;

    return 1ll*max(min(pos,q[ans][k])-max(l,q[ans-][k]+)+,)*(r-max(pos,q[ans][k])+);

}

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;++i) scanf("%d",&a[i][]);

    for(int i=;i<=n;++i) scanf("%d",&a[i][]);

    s[]=s[]=q[][]=q[][]=;

    for(int i=;i<=n;++i)

        for(int j=;j<;++j)

        {

            while(s[j]&&a[q[s[j]][j]][j]<=a[i][j]) ans+=calc(q[s[j]][j],a[q[s[j]][j]][j],q[s[j]-][j]+,i-,j^),s[j]--;

            q[++s[j]][j]=i;

        }

    for(int i=;i<=s[];i++) ans+=calc(q[i][],a[q[i][]][],q[i-][]+,n,);

    printf("%lld\n",ans);

}