#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;


int main(){
  int N;
  cin >> N;

  vector<pair<ll,int>> v;
  vector<ll> w;
  rep(i,N){
    ll a;
    cin >> a;
    v.emplace_back(a,i);
  }
  rep(i,N){
    ll a;
    cin >> a;
    w.push_back(a);
  }

  sort(ALLOF(v));

  ll ret = -1;
  ll cnt = 0;
  do {
    ll tmp = 0;
    rep(i,v.size()){
      if(v[i].first > w[i]) tmp += v[i].first - w[i];
    }
    if(ret < tmp){
      ret = tmp;
      cnt = 1;
    }
    else if(ret == tmp){
      cnt++;
    }
  }while(next_permutation(ALLOF(v)));
  cerr << ret << endl;
  cout << cnt << endl;
  
  return 0;
}