include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;
const long INF = 1e9;
int a[10000];
int b[10000];
long long a1[200001];
int n;

int deall(int x){
int l=x-1;
while(a[l]<a[x])
l--;
return l;
}

int dealr(int x){
int r=x;
while(a[r]<=a[x])
r++;
return r;
}
long long ans;

int dealll(int x){
int l=x-1;
while(b[l]<b[x])
l--;
return l;
}

int dealrr(int x){
int r=x;
while(b[r]<=b[x])
r++;
return r;
}

int main(){
cin>>n;
for(int i=1;i<=n;++i)
{
cin>>a[i];
}
for(int i=1;i<=n;++i)
cin>>b[i];
a[0]=a[n+1]=b[0]=b[n+1]=INF;
//cout<<deall(2);
//cout<<endl;
for(int i=1;i<=n;++i)
{
int l=deall(i);
int r=dealr(i);
a1[a[i]]+=(
(i-l)(r-i)%1000000007
) ;
a1[a[i]]%=1000000007;
}
// cout<<a1[1];
for( int i=1;i<=n;++i)
{
int l=dealll(i);
int r=dealrr(i);
if(a1[b[i]])
{
ans+=(a1[b[i]](i-l)*(r-i)%1000000007);
ans%=1000000007;
}
}
printf("%lld",ans%1000000007);
return 0;
}