#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < n; ++i) {
    cin >> b[i];
  }
  vector<int> order(n);
  for (int i = 0; i < n; ++i) {
    order[i] = i;
  }
  map<int, int> mp;
  do {
    int score = 0;
    for (int i = 0; i < n; ++i) {
      score += max(0, a[order[i]] - b[i]);
    }
    mp[score]++;
  } while (next_permutation(order.begin(), order.end()));
  cout << mp.rbegin()->second << endl;
  return 0;
}