//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll,double>>>;

vector<pair<ll,ll>> Z;
double dist(ll A,ll B){
    ll dx=Z[A].first-Z[B].first;
    ll dy=Z[A].second-Z[B].second;
    return sqrt(dx*dx+dy*dy);
}

ll mod=1e9+7;
int main() {
   ll N;
   cin>>N;
   vll A(N),B(N),P(N);
   rep(i,N)cin>>A[i];
   rep(i,N)cin>>B[i];
   rep(i,N)P[i]=i;
   ll an=0;
   do {
       ll k=0;
       rep(p,N){
           if(A[P[p]]>B[p])k+=A[P[p]]-B[p];
       }
       an=max(an,k);
   }while(next_permutation(all(P)));
    ll AN=0;
    //cout<<an<<endl;
    rep(i,N)P[i]=i;
do {
       ll k=0;
       rep(p,N){
           if(A[P[p]]>B[p])k+=A[P[p]]-B[p];
       }
       if(an==k)AN++;
   }while(next_permutation(all(P)));


   cout<<AN<<endl;
}