#include <bits/stdc++.h>
using namespace std;

int main()
{
	int N;
	cin >> N;
	vector<int> a( N );
	for( int i = 0; i < N; i++ ) {
		cin >> a[i];
	}
	vector<int> b( N );
	for( int i = 0; i < N; i++ ) {
		cin >> b[i];
	}

	vector<int> o( N );
	for( int i = 0; i < N; i++ ) {
		o[i] = i;
	}
	map<long long, long long> mp;
	long long ma = 0;
	do {
		long long w = 0;
		for( int i = 0; i < N; i++ ) {
			w += max( 0, a[ o[i] ] - b[i] );
		}
		mp[w]++;
		ma = max( ma, w );
	} while( next_permutation( o.begin(), o.end() ) );
	long long ans = mp[ma];

	cout << ans << endl;
}