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

int main() {
  int N;
  cin >> N;
  vector<pair<int, int>> A(N);
  for (int i = 0, a; i < N && cin >> a; i++) A.at(i) = {i, a};
  vector<int> B(N);
  for (int i = 0; i < N; i++) cin >> B.at(i);

  sort(A.begin(), A.end());
  map<int, int> MA;
  do {
    int tmp = 0;
    for (int i = 0; i < N; i++) {
      if (A.at(i).second > B.at(i)) tmp += A.at(i).second - B.at(i);
    }
    MA[tmp]++;
  } while (next_permutation(A.begin(), A.end()));
  auto ans = *rbegin(MA);
  cout << ans.second << "\n";
}