#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<random>
using namespace std;
typedef long long ll;
const int mod=998244353;
int main(){
	int n,a[9],b[9];
	cin>>n;
	for(int i=0;i<n;i++)
		cin>>a[i];
	for(int i=0;i<n;i++)
		cin>>b[i];
	int mx=-1,ans=0;
	int arr[9];
	iota(arr,arr+n,0);
	do{
		int tmp=0;
		for(int i=0;i<n;i++)
			if(a[arr[i]]>b[i])
				tmp+=a[arr[i]]-b[i];
		if(tmp==mx)
			ans++;
		if(tmp>mx){
			mx=tmp;
			ans=1;
		}
	}while(next_permutation(arr,arr+n));
	cout<<ans<<endl;
}