#include<bits/stdc++.h>
using namespace std;
int n,a[100],b[100],sum,ans,j=1;
bool vis=true;
void found(){
    while(vis){
        for(int i=n;i>1;i--){
            a[i]=a[i-1];
        } 
        ans++;
        a[1]=1;
        vis=false;
        for(int i=1;i<=n;i++){
            if(a[i]>b[i]){
                vis=true;
            }
        }
    }
}
int main(){
    freopen("proposal.in","r",stdin);
    freopen("proposal.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        cin>>b[i];
        if(b[i]==1){
            sum++;
        }
    }
    if(n==2){
        if(a[1]<=b[1]){
            if(a[2]>b[2]){
                cout<<1;
            }else{
                cout<<0;
            }
        }else{
            if(a[1]<=b[2]){
                cout<<1;
            }else{
                cout<<2;
            }
        }
        return 0;
    }
    if(sum==n){
        for(int i=1;i<=n;i++){
            if(a[i]-1>0){ 
                ans++; 
            }
        }
        cout<<ans;
        return 0;
    }
    if(n==3){
        if(a[1]<=b[1]){
            if(a[2]<=b[2]){
                if(a[3]<=b[3]){
                    cout<<0;
                }else{
                    cout<<1;
                }
            }else{
                if(a[2]<=b[3]){
                    cout<<1;
                }else{
                    cout<<2;
                }
            }
        }else{
            if(a[1]<=b[2]){
                if(a[2]<=b[2]){
                    cout<<1;
                }else{
                    if(a[2]<=b[3]){
                        cout<<1;
                    }else{
                        cout<<2;
                    }
                }
            }else{
                if(a[1]<=b[3]){
                    cout<<2;
                }else{
                    cout<<3;
                }
            }
        }
        return 0;
    }
    found();
    cout<<ans;
    return 0;
}