#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int N;
    cin >> N;
    ll res = 0;
    ll cnt = 0;
    vector<ll> A(N), B(N);
    rep(i, N) cin >> A[i];
    rep(i, N) cin >> B[i];
    vector<pair<int, ll>> vec(N);
    rep(i, N) { vec[i] = {i, A[i]}; }
    sort(All(vec));
    do {
        ll tmp = 0;
        for(int i = 0; i < N; i++) {
            tmp += max(vec[i].second - B[i], 0LL);
        }
        if(tmp == res) {
            cnt++;
        } else if(tmp > res) {
            cnt = 1;
            res = tmp;
        }
    } while(next_permutation(All(vec)));
    cout << cnt << endl;
}