#include<iostream>

#include<cstring>

#include<cstdlib>

#include<cstdio>

#include<algorithm>

#define ll long long

using namespace std;

const int maxn=,inf=1e9;

int n,m,x,y,z,tot,topa,topb;

int a[maxn],b[maxn],sta[maxn],stb[maxn];

ll ans;

void read(int &k)

{

    int f=;k=;char c=getchar();

    while(c<''||c>'')c=='-'&&(f=-),c=getchar();

    while(c<=''&&c>='')k=k*+c-'',c=getchar();

    k*=f;

}

int main()

{

    read(n);

    for(int i=;i<=n;i++)read(a[i]);

    for(int i=;i<=n;i++)read(b[i]);

    a[++n]=inf;b[n]=inf-;

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

    {

        for(;topa&&a[sta[topa]]<=a[i];topa--)

        {

            if(!topb)continue;

            int l=,r=topb;

            while(l<r)

            {

                int mid=(l+r)>>;

                if(b[stb[mid]]<=a[sta[topa]])r=mid;

                else l=mid+;

            }

            int x=l;if(b[stb[x]]!=a[sta[topa]])continue;

            ans+=1ll*max(,min(stb[x],sta[topa])-max(stb[x-],sta[topa-]))*(i-max(stb[x],sta[topa]));

        }

        for(;topb&&b[stb[topb]]<=b[i];topb--)

        {

            if(!topa)continue;

            int l=,r=topa;

            while(l<r)

            {

                int mid=(l+r)>>;

                if(a[sta[mid]]<=b[stb[topb]])r=mid;

                else l=mid+;

            }

            int x=l;if(a[sta[x]]!=b[stb[topb]])continue;

            ans+=1ll*max(,min(sta[x],stb[topb])-max(sta[x-],stb[topb-]))*(i-max(sta[x],stb[topb]));

        }

        sta[++topa]=stb[++topb]=i;

    }

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

    return ;

}