//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl '\n'
int n;
int aa[500001];
int bb[500001];
int ind[500001];
llo check(llo mid){
llo ind=n-mid;
for(int i=0;i<mid;i++){
if(aa[i]>bb[ind]){
return false;
}
ind++;
}
return true;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
int st=1;
for(int i=0;i<n;i++){
cin>>ind[i];
if(ind[i]!=1){
st=0;
}
}
for(int i=0;i<n;i++){
cin>>aa[i];
}
for(int i=0;i<n;i++){
cin>>bb[i];
}
if(st){
sort(aa,aa+n);
sort(bb,bb+n);
llo low=0;
for(int j=19;j>=0;j--){
if(low+(1<<j)<=n){
if(check(low+(1<<j))){
low+=(1<<j);
}
}
}
cout<<low<<endl;
}
return 0;
}
