#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>

using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define debug(output) cout<<#output<<"= "<<output<<endl

using P=pair<int,int>;
using lint=long long;
using ll=long long;
const lint inf=1e18+7;
const int MOD=1000000007;
signed main(){
  int n;cin>>n;
  vector<int> b(n);
  vector<P> a(n);
  rep(i,n){
    cin>>a[i].first;
    a[i].second=i;
  }
  rep(i,n)cin>>b[i];
  sort(a.begin(),a.end());
  lint mx=0;
  do{
    lint buf=0;
    rep(i,n){
      if(a[i].first>b[i])buf+=a[i].first-b[i];
    }
    mx=max(mx,buf);
  }while(next_permutation(a.begin(),a.end()));
  int cnt=0;
  sort(a.begin(),a.end());
  do{
    lint buf=0;
    rep(i,n){
      if(a[i].first>b[i])buf+=a[i].first-b[i];
    }
    if(buf==mx)++cnt;
  }while(next_permutation(a.begin(),a.end()));
  cout<<cnt<<"\n";
  return 0;
}