#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 poly vector<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],C[N<<1];
int solve(int op,poly A,poly B) {
    if(A.empty()||B.empty()) return 0;
    if(A[0]>B.back()) return mn(A.size(),B.size());
    if(B[0]>A.back()) return 0;
    C[0]=0;
    for(int&V:A) C[++C[0]]=V;
    for(int&V:B) C[++C[0]]=V;
    sort(C+1,C+C[0]+1);
    for(int&V:A) V=lower_bound(C+1,C+C[0]+1,V)-C;
    for(int&V:B) V=lower_bound(C+1,C+C[0]+1,V)-C;
    if(op==1) {
        int len=A.size(),pos=0;C[0]=lower_bound(B.begin(),B.end(),A[0])-B.begin();
        for(int i=1;i<len;++i) {
            C[i]=lower_bound(B.begin(),B.end(),A[i])-B.begin();
            if(C[i]==B.size()) break;
            if(B[C[i]]-A[i]>=B[C[pos]]-A[pos]) pos=i;
        }
        B.erase(lower_bound(B.begin(),B.end(),A[pos]));
        A.erase(A.begin()+pos);
        return solve(2,A,B);
    } else {
        int len=B.size(),pos=0;C[0]=lower_bound(A.begin(),A.end(),B[0])-A.begin();
        for(int i=1;i<len;++i) {
            C[i]=lower_bound(A.begin(),A.end(),B[i])-A.begin();
            if(C[i]==A.size()) break;
            if(A[C[i]]-B[i]>=A[C[pos]]-B[pos]) pos=i;
        }
        A.erase(lower_bound(A.begin(),A.end(),B[pos]));
        B.erase(B.begin()+pos);
        return solve(1,A,B)+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);
    poly now1,now2; now1.resize(n);now2.resize(n);
    for(int i=1;i<=n;++i) now1[i-1]=a[i],now2[i-1]=b[i];
    printf("%d\n",solve(1,now1,now2));
    return 0;
}