#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    vector<double> a(n);
    vector<int>b(n);
    for(auto&ai:a)cin>>ai;
    for(auto&bi:b)cin>>bi;
    for(double i=0;i<n;i+=1)a[int(i)]+=0.1*i;
    int pmax=0,ans=0;
    sort(begin(a),end(a));
    do{
        int p=0;
        for(int i=0;i<n;++i)if(a[i]>b[i]){
            p+=a[i]-b[i];
        }
        if(p>pmax){
            pmax=p;
            ans=1;
        }
        else if(p==pmax)ans++;
    }while(next_permutation(begin(a),end(a)));
    cout<<ans<<endl;
}