// Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T> 
inline bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
struct IOSET {
    IOSET() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} ioset;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &element : vec) is >> element;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) {
        os << vec[i] << " \n"[i + 1 == vec_len];
    }
    return os;
}

// Main
int main() {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    cin >> a >> b;
    
    int mx = 0;
    vector<int> vec(n);
    iota(all(vec), 0);
    do {
        int res = 0;
        rep(i, n) {
            if (a[vec[i]] > b[i]) res += a[vec[i]] - b[i];
        }
        chmax(mx, res);
    } while (next_permutation(all(vec)));
    sort(all(vec));
    int ans = 0;
    do {
        int res = 0;
        rep(i, n) {
            if (a[vec[i]] > b[i]) res += a[vec[i]] - b[i];
        }
        if (res == mx) ++ans;
    } while (next_permutation(all(vec)));
    
    cout << ans << "\n";
}