#include<bits/stdc++.h>

using namespace std;
using ll = long long;


int main()
{
	int N; cin >> N;
	vector<pair<int,int>> A(N);
	for(int i = 0; i < N; i++)A[i].second = i;
	vector<int> B(N);
	for(int i = 0; i < N; i++)cin >> A[i].first;
	for(int i = 0; i < N; i++)cin >> B[i];
	sort(A.begin(), A.end());
	map<int,int> mp;

	do {
		int cost = 0;
		for(int i = 0; i < N; i++) cost += max(0, A[i].first - B[i]);
		mp[cost]++;
	} while (next_permutation(A.begin(), A.end()));

	cout << mp.rbegin() -> second << endl;

}