/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.11.06 21:35:02
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int bitpopcount(ll n) {
    int res = 0;
    while (n) {
        if (n & 1) res++;
        n >>= 1;
    }
    return res;
}
int main() {
    int n;cin >> n;
    vector<pair<int,int>> a(n);
    vector<int> b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    sort(a.begin(), a.end());
    int m = 0;
    do {
        int sum = 0;
        for (int i = 0; i < n; i++) {
            sum += max(0,a[i].first-b[i]);
        }
        m = max(m,sum);
    } while(next_permutation(a.begin(), a.end()));
    
    sort(a.begin(), a.end());
    int ans = 0;
    do {
        int sum = 0;
        for (int i = 0; i < n; i++) {
            sum += max(0,a[i].first-b[i]);
        }
        if (sum == m) {
            ans++;
        }
    } while(next_permutation(a.begin(), a.end()));
    cout << ans << endl;
    return 0;
}