#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N;
int A[9];
int B[9];

int main() {
	int N; cin >> N;
	rep(i, N) cin >> A[i];
	rep(i, N) cin >> B[i];

	vector<int> P(N); rep(i, N) P[i] = i;
	int maxscore = 0, maxscoreC = 0;
	do {
		int score = 0;
		rep(i, N) {
			if (A[P[i]] > B[i]) score += A[P[i]] - B[i];
		}
		if (maxscore < score) { maxscore = score; maxscoreC = 1; }
		else if (maxscore == score) { maxscore = score; maxscoreC += 1; }
	}
	while (next_permutation(P.begin(), P.end()));

	cout << maxscoreC << endl;

	return 0;
}