#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;

int N, a[10], b[10], c[10], sum, res = -1, cnt;

int main() {
  cin >> N;
  for (int i = 0; i < N; i++) cin >> a[i];
  for (int i = 0; i < N; i++) cin >> b[i];
  for (int i = 0; i < N; i++) c[i] = i;
  do {
    sum = 0;
    for (int i = 0; i < N; i++) {
      sum += max(a[c[i]] - b[i], 0);
    }
    //cout << sum << ' ' << res << endl;
    if (sum > res) {
      res = sum;
      cnt = 1;
    } else if (sum == res) {
      cnt++;
    }
  } while (next_permutation(c, c + N));
  cout << cnt << endl;
  return 0;
}