#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<ll,ll> P;
typedef modint1000000007 mint;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a;i>=b;i--)
ll n;
ll a[10],b[10];
ll p[10];
ll cnt,m;
ll ans;
int main(void){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cin>>n;
    rep(i,0,n){
        p[i]=i;
    }
    rep(i,0,n){
        cin>>a[i];
    }
    rep(i,0,n){
        cin>>b[i];
    }
    do{
        cnt=0;
        rep(i,0,n){
            cnt+=max(0ll,a[p[i]]-b[i]);
        }
        m=max(m,cnt);
    }while(next_permutation(p,p+n));
    rep(i,0,n){
        p[i]=i;
    }
    do{
        cnt=0;
        rep(i,0,n){
            cnt+=max(0ll,a[p[i]]-b[i]);
        }
        if(cnt==m){
            ans++;
        }
    }while(next_permutation(p,p+n));
    cout<<ans<<endl;

}