#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

int main(){
    int n;
    cin >> n;
    vector<int> a(n),b(n);
    rep(i,n) cin >> a[i];
    rep(i,n) cin >> b[i];
    int ans = 0;
    int mx = 0;
    vector<int> id(n);
    iota(id.begin(),id.end(),0);

    do{
        int res = 0;
        rep(i,n){
            if(a[id[i]] > b[i]) res += a[id[i]] - b[i];
        }
        if(res > mx){
            mx = res;
            ans = 1;
        }else if(res == mx){
            ans ++;
        }
    }while(next_permutation(id.begin(),id.end()));

    cout << ans << endl;
    return 0;
}