#include <iostream>
using namespace std;

void sortArray(int arr[], int N) {
    for (int i = 0; i < N - 1; i++) {
        for (int j = i + 1; j < N; j++) {
            if (arr[i] > arr[j]) {
                // Swap elements
                int temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
    }
}

int minPlatforms(int arrival[], int departure[], int N) {
    if (N <= 0) {
        cout << "Invalid input" << endl;
        return -1;
    }

    // Sort the arrival and departure arrays
    sortArray(arrival, N);
    sortArray(departure, N);

    int platforms = 1, result = 1;
    int i = 1, j = 0;

    while (i < N && j < N) {
        if (arrival[i] <= departure[j]) {
            platforms++;
            i++;
        }
        else {
            platforms--;
            j++;
        }
        result = (platforms > result) ? platforms : result;
    }

    return result;
}

int main() {
    int N;
    cin >> N;

    if (N <= 0) {
        cout << "Invalid input" << endl;
        return 0;
    }

    int arrival[N], departure[N];

    for (int i = 0; i < N; i++) {
        cin >> arrival[i];
    }

    for (int i = 0; i < N; i++) {
        cin >> departure[i];
    }

    cout << minPlatforms(arrival, departure, N) << endl;

    return 0;
}