#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for (auto &&i : a) scanf("%d", &i);
    for (auto &&i : b) scanf("%d", &i);
    int val = -1, ans = 1;
    vector<int> p(n);
    iota(p.begin(),p.end(), 0);
    do {
        int cnt = 0;
        for (int i = 0; i < n; ++i) cnt += max(0, a[p[i]]-b[i]);
        if(val < cnt) val = cnt, ans = 1;
        else if(val == cnt) ans++;
    }while(next_permutation(p.begin(),p.end()));
    cout << ans << "\n";
    return 0;
}