#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;

int main() {
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i,n) cin >> a[i];
  rep(i,n) cin >> b[i];
  
  vector<int> id(n, 0);
  rep(i,n) id[i] = i;
  map<int, int> mp;
  int res = 0;
  int cur = -1;
  do {
    int tmp = 0;
    rep(i,n) tmp += max(0, a[id[i]] - b[i]);
    mp[tmp]++;
  } while (next_permutation(id.begin(), id.end()));
  for (auto e : mp) {
    if (cur < e.first) res = e.second;
  }
  cout << res << endl;
  return 0;
}