#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>

#define rep(i, n) for(int i = 0; i < n; i++)
#define per(i, n) for(int i = n - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mod 1000000007
using namespace std;
int main(){
  int n;
  cin >> n;
  vi a(n), b(n), v(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  rep(i, n) v[i] = i;
  int ans = 0, val = 0;
  do{
    int res = 0;
    rep(i, n)
      if(a[v[i]] > b[i]) res += a[v[i]] - b[i];
    if(val == res) ans++;
    else if(val < res){
      val = res;
      ans = 1;
    }
  } while(next_permutation(all(v)));
  cout << ans << "\n";
}