#include<bits/stdc++.h>
using namespace std;
long const mod = 1e9+7;
int main(){
    int n;
    cin >> n;
    long a[n];
    long b[n];
    for(int i=0;i<n;i++)cin >> a[i];
    for(int i=0;i<n;i++)cin >> b[i];
    vector<int>per(n);
    for(int i=0;i<n;i++)per[i] = i;
    long maxx = 0;
    map<long,long>mapp;
    do{
        long tmp = 0;
        for(int i=0;i<n;i++){
            if(a[per[i]] > b[i]){
                tmp += a[per[i]] - b[i];
            }
        }
        mapp[tmp]++;
        maxx = max(maxx,tmp);
    }while(next_permutation(per.begin(),per.end()));

    cout << mapp[maxx] << endl;
}