#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>


int main() {

  int N;
  cin >> N;
  P a[N];
  int b[N];

  rep(i, N) {
    int x;
    cin >> x;
    a[i] = {i, x};
  }

  rep(i, N) cin >> b[i];

  vector<int> vec;
  int MAX = 0;

  // 順列全探索
  do {
    int point = 0;

    rep(i, N) {
      if (a[i].second > b[i]) point += a[i].second - b[i];
    }

    vec.push_back(point);
    MAX = max(MAX, point);
    
  } while(next_permutation(a, a+N));

  int ans = 0;
  rep(i, vec.size()) {
    if (vec[i] == MAX) ans++;
  }

  cout << ans << endl;







  




}