#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T &b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T &b){
    if(a < b) {a = b; return true;}
    else return false;
}

int solve(vec &a, vec &b){
    int res(0);
    rep(i, N) res += max(0LL, a[i] - b[i]);
    return res;
}

int main(){
    cin>>N;
    vec a(N), b(N), ord(N);
    rep(i, N) cin>>a[i];
    rep(i, N) cin>>b[i];
    iota(ALL(ord), 0);
    map<int, int> ans;
    do{
        vec c(N);
        rep(i, N) c[i] = a[ord[i]];
        ++ans[solve(c, b)];
    }while(next_permutation(ALL(ord)));
    cout<<ans.rbegin()->se<<endl;
}