#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>

using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;


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);
    rep(i,n) id[i] = i;
    ll M = 0;
    do {
        ll now = 0;
        rep(i,n){
            now += max(0,a[id[i]]-b[i]);
        }
        M = max(M,now);
    }while(next_permutation(id.begin(),id.end()));
    int ans = 0;
    do {
        ll now = 0;
        rep(i,n){
            now += max(0,a[id[i]]-b[i]);
        }
        if(now == M) ans++;
    }while(next_permutation(id.begin(),id.end()));
    cout << ans << endl;
}