#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
#define fi first
#define sc second
#define mkp make_pair
#define pii pair<int,int>
typedef long long ll;
#define pli pair<ll,int>
const int N=1005,oo=1e9;
inline int read() {
    int x=0,flag=0;char ch=getchar();
    while(ch<'0'||ch>'9') {flag|=(ch=='-');ch=getchar();}
    while('0'<=ch&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return flag?-x:x;
}
inline int mx(int x,int y) {return x>y?x:y;}
inline int mn(int x,int y) {return x<y?x:y;}
inline void swp(int &x,int &y) {x^=y^=x^=y;}
inline int as(int x) {return x>0?x:-x;}

int n,a[N],b[N];
int solve(int op,int l,int r,int L,int R) {
    if(l>r||L>R) return 0;
    if(a[l]>b[R]) return mn(r-l+1,R-L+1);
    if(b[L]>a[r]) return 0;
    if(op==1) { int ans=0;
        while(l<=r&&a[r]>b[R]) --r,++ans;
        if(l>r) return ans;
        return ans+=solve(2,l+1,r,L+1,R);
    } else {
        while(L<=R&&b[R]>a[r]) --R;
        if(L>R) return 0;
        return solve(1,l+1,r,L+1,R)+1;
    }
}
int main() {
    n=read();
    for(int i=1;i<=n;++i) a[i]=read();
    for(int i=1;i<=n;++i) b[i]=read();
    sort(a+1,a+n+1); sort(b+1,b+n+1);
    printf("%d\n",solve(1,1,n,1,n));
    return 0;
}