#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
long long GCD(long long a,long long b) {
  if(a%b == 0) return b;
  return GCD(b,a%b);
}
int main() {
  long long N; cin >> N;
  vector<int> A(N);
  vector<int> B(N);
  vector<int> X(N);
  for(int i = 0; i < N; i++) X[i] = i;
  for(int i = 0; i < N; i++) cin >> A[i];
  for(int i = 0; i < N; i++) cin >> B[i];
  sort(X.begin(),X.end());
  int ans = 0;
  map<int,int> dic;
  do{
    int count = 0;
        for(int i=0; i<N; i++){
            if(A[X[i]] > B[i]) {
              count += (A[X[i]] - B[i]);
            }
        }
        ans = max(ans,count);
    dic[count]++;
    }while(next_permutation(X.begin(),X.end()));
  cout << dic[ans] << endl;
}