#include <atcoder/all>
#include <bits/stdc++.h>

typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007LL; //998244353LL;
static const LLONG INF_NUM = 1000000007LL;

template<class _T> static void get(_T& a) {
	std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
	std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
	std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
	if (a < (_T)0) {
		a *= (_T)-1;
	}
	return a;
}
template <class _T> static _T tp_pow(int base, int exp)
{
	_T ans = 1;

	for (int i = 0; i < exp; i++) {
		ans *= (_T)base;
	}
	return ans;
}

static void A_task();

int main()
{
	A_task();
	fflush(stdout);
	return 0;
}

static void makePth(int N, std::vector<std::vector<int>>& ptn, std::vector<int> nowPtn, int idx, std::vector<int>& use)
{
	if (idx == N - 1) {
		for (int i = 0; i < N; i++) {
			if (use[i] == 0) {
				nowPtn[idx] = i;
				break;
			}
		}

		ptn.push_back(nowPtn);
		return;
	}

	for (int i = 0; i < N; i++) {
		if (use[i] == 0) {
			nowPtn[idx] = i;
			use[i] = 1;
			makePth(N, ptn, nowPtn, idx + 1, use);
			use[i] = 0;
		}
	}
}

static void A_task()
{
	int N;
	get(N);

	std::vector<int> ai(N), bi(N);
	for (int i = 0; i < N; i++) {
		get(ai[i]);
	}
	for (int i = 0; i < N; i++) {
		get(bi[i]);
	}

	std::vector<std::vector<int>> ptn;
	std::vector<int> nowPtn(N, 0), use(N, 0);
	makePth(N, ptn, nowPtn, 0, use);

	std::map<int, int> points;
	for (auto it = ptn.begin(); it != ptn.end(); it++) {
		int pt = 0;
		int i = 0;
		for (auto idx = it->begin(); idx != it->end(); idx++, i++) {
			pt += std::max(0, ai[*idx] - bi[i]);
		}
		points[pt]++;
	}
	printf("%d\n", points.rbegin()->second);
}