#include <iostream>
#include <algorithm>
#include <vector>

void solve() {
    int n;
    std::cin >> n;

    std::vector<std::pair<int, int>> xs(n);
    for (int i = 0; i < n; ++i) {
        xs[i].first = i;
        std::cin >> xs[i].second;
    }

    std::vector<int> ys(n);
    for (auto& y : ys) std::cin >> y;

    int max = -1, ans = 0;
    do {
        int sum = 0;
        for (int i = 0; i < n; ++i) {
            sum += std::max(xs[i].second - ys[i], 0);
        }

        if (sum > max) {
            max = sum;
            ans = 0;
        }

        if (sum == max) ++ans;
    } while (std::next_permutation(xs.begin(), xs.end()));

    std::cout << ans << "\n";
}

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

    solve();

    return 0;
}