#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  vector<int> a(n), b(n);
  REP (i, n) cin >> a[i];
  REP (i, n) cin >> b[i];

  vector<int> v;
  REP (i, n) v.push_back(i);

  int maxv = -1;
  int ret = 0;
  do {
    int sum = 0;
    REP (i, n) {
      if (a[v[i]] > b[i])
        sum += a[v[i]] - b[i];
    }
    
    if (sum == maxv)
      ++ret;
    else if (sum > maxv) {
      maxv = sum;
      ret = 1;
    }
  } while (next_permutation(v.begin(), v.end()));

  cout << ret << endl;
  
  return 0;
}