/* -*- coding: utf-8 -*-
 *
 * 1279.cc:  No.1279 Array Battle - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 9;

/* typedef */

/* global variables */

int as[MAX_N], bs[MAX_N], ps[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  for (int i = 0; i < n; i++) scanf("%d", bs + i);
  for (int i = 0; i < n; i++) ps[i] = i;

  int maxsum = -1, maxc = 0;
  do {
    int sum = 0;
    for (int i = 0; i < n; i++)
      if (as[ps[i]] > bs[i]) sum += as[ps[i]] - bs[i];
    if (maxsum < sum)
      maxsum = sum, maxc = 1;
    else if (maxsum == sum)
      maxc++;
  } while (next_permutation(ps, ps + n));

  printf("%d\n", maxc);
  return 0;
}