#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()
const ll MOD=1000000007;
const ll INF=1e18;

int main(){
	int n; cin >> n;
	vector<P> a(n); VI b(n);
	REP(i,n) cin >> a[i].first;
	REP(i,n) a[i].second=i;
	REP(i,n) cin >> b[i];
	sort(ALL(a));
	map<int,int> mp;
	int mx=0;
	int ans=0;
	do{
		int sum=0;
		REP(i,n)
			sum+=max(0ll,a[i].first-b[i]);
		mp[sum]++;
		mx=max(mx,sum);
	}while(next_permutation(ALL(a)));
	cout << mp[mx] << endl;
	return 0;
}