#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int N, sm;
    map<int, int> mp;
    cin >> N;
    vector<int> a(N), b(N), c(N);
    for (int i=0; i<N; i++) cin >> a[i];
    for (int i=0; i<N; i++) cin >> b[i];
    iota(c.begin(), c.end(), 0);

    do{
        sm = 0;
        for (int i=0; i<N; i++){
            sm += max(0, a[c[i]]-b[i]);
        }
        mp[sm]++;
    } while(next_permutation(c.begin(), c.end()));

    cout << mp.rbegin()->second << endl;

    return 0;
}