#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define x first
#define y second

int f(vector<int> a, vector<int> b){
    int k = a.size();
    if(k == 0) return 0;
    if(a[0] > b[k - 1]) return k;
    if(b[0] > a[k - 1]) return 0;

    int z = -2222, w = 2222;
    int q = 0;
    /*while(p < k){
        while(q != k - 1 && a[p] > b[q]){
            q ++;
        }
        if(p - q > z - w){
            z = p;
            w = q;
        }
        p ++;
    }*/
    
    for(int p = 0 ; p < k ; p ++){
        while(q != k - 1 && a[p] > b[q]){
            q ++;
        }
        if(p - q > z - w){
            z = p;
            w = q;
        }
    }

    /*for(int i = 0 ; i < k ; i ++){
        for(int j = 0 ; j < k ; j ++){
            if(a[i] < b[j] && i - j > z - w){
                z = i;
                w = j;
                break;
            }
        }
    }*/
    vector<int> c, d;
    for(int i = 0 ; i < k ; i ++){
        if(i != z) c.push_back(a[i]);
        if(i != w) d.push_back(b[i]);
    }
    return k - 1 - f(d, c);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;
    vector<int> a, b;
    for(int i = 0 ; i < n ; i ++){
        int data;
        cin >> data;
        a.push_back(data);
    }
    for(int i = 0 ; i < n ; i ++){
        int data;
        cin >> data;
        b.push_back(data);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    cout << f(a, b);

    return 0;
}