#include<iostream>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 const int maxn =  + ;

 int a[maxn];

 int b[maxn];

 int n;

 int main()

 {

     //freopen("D:\\txt.txt", "r", stdin);

     while (cin >> n && n)

     {

         for (int i = ; i < n; i++)

             cin >> a[i];

         for (int i = ; i < n; i++)

             cin >> b[i];

         sort(a, a + n);

         sort(b, b + n);

         int sum = ;

         int p1 = , p2 = n - , q1 = , q2 = n - ;

         while (n--)

         {

             if (a[p2]>b[q2])

             {

                 p2--;

                 q2--;

                 sum += ;

             }

             else if (a[p1] > b[q1])

             {

                 p1++;

                 q1++;

                 sum += ;

             }

             else if (a[p1]<b[q2])   //用最慢的和齐王对快的比

             {

                 p1++;

                 q2--;

                 sum -= ;

             }

             else             //平局的情况

             {

                 p1++;

                 q2--;

             }

         }

         cout << sum << endl;

     }

 }