#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n;
	cin >> n;

	vector<int> a(n), b(n);
	rep(i, n) cin >> a[i];
	rep(i, n) cin >> b[i];

	vector<int> idx(n);
	rep(i, n) idx[i] = i;

	int ans = 0;
	int mx = 0;
	do{
		int tmp = 0;
		rep(i, n){
			if(a[idx[i]] > b[i]) tmp += a[idx[i]] - b[i];
		}

		if(tmp > mx){
			ans = 1;
			mx = tmp;
		}else if(tmp == mx){
			ans++;
		}

	}while(next_permutation(idx.begin(), idx.end()));

	cout << ans << endl;
}