#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll a[105],b[105],s[105];
int tag=1,n;
bool cmp(int a,int b){
    return a>b;
}
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];
    b[n+1]=1e9;
    for(int i=1;i<=n;i++){
        while(tag<=n+1){
            if(a[i]>b[tag])tag++;
            else break;
        } 
        s[i]=max(0,tag-i);
    }
    sort(s+1,s+1+n,cmp);
    cout<<s[1];
    return 0;
}