#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N;
  cin >> N;
  vector<int> a(N);
  REP(i, N) cin >> a[i];
  vector<int> b(N);
  REP(i, N) cin >> b[i];
  int mx = 0;
  int cnt = 0;
  vector<int> p(N);
  REP(i, N) p[i] = i;
  do{
    int score = 0;
    REP(i, N) score += max(0, a[p[i]] - b[i]);
    if(score > mx) {
      mx = score;
      cnt = 1;
    } else if(score == mx) {
      cnt++;
    }
    //cout << mx << " " << cnt << endl;
  } while(next_permutation(ALL(p)));
  cout << cnt << endl;
}