#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include <bits/stdc++.h>
using namespace std;

int main(){
  int n;
  cin>>n;
  
  vector<int> A(n+1),B(n+1),C(n);
  rep(i,n) cin>>A[i+1];
  rep(i,n) cin>>B[i+1];
  rep(i,n) C[i]=i+1;
  
  ll ma=0,cnt=0;
  do{
    ll tmp=0;
    rep(i,n){
      if(A[C[i]]>B[i+1]) tmp+=A[C[i]]-B[i+1];
    }
    if(tmp>ma){
      ma=tmp;
      cnt=1;
    }
    else if(tmp==ma) cnt++;
  }while(next_permutation(ALL(C)));
  
  cout<<cnt<<endl;
         
  return 0;
}