#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int N = 5010;
int n, m, s, a[N], b[N];
inline int cmp(const void *x, const void *y) {
    return *(int *)x - *(int *)y;
}
int main() {
    freopen("horsea.in", "r", stdin);
    freopen("horsea.out", "w", stdout);
    scanf("%d", &n);
    m = n;
    for(int i=1; i<=n; i++)
        scanf("%d", a+i);
    for(int i=1; i<=n; i++)
        scanf("%d", b+i);
    qsort(a, n, sizeof(a[0]), cmp);
    qsort(b, n, sizeof(b[0]), cmp);
    for(int i=n; i>0; i--) {
        while(m > 0 && a[m] >= b[i]) m--;
        if(a[m] == b[i])
            for(int j=m-1; j>0; j--)
                if(a[j] < b[i]) {
                    for(int k=j; k<=m; k++)
                        a[j] = a[j+1];
                    m--;
                }
        if(m > 0) s++; else break;
        m--;
    }
    printf("%d\n", s * 2 - n);
    return 0;
}