#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n; cin >> n;
    int a[n] = {};
    rep(i,n) cin >> a[i];
    int b[n];
    rep(i,n) cin >> b[i];
    const int N = n;
    vector<int> v(N);
    int ans = 0;
    int ma = -1;
    iota(v.begin(), v.end(), 0);       // v に 0, 1, 2, ... N-1 を設定
    do {
        int tmp = 0;
        rep(i,n){
            if(a[i] > b[v[i]]) tmp += a[i] - b[v[i]];
            if(tmp == ma){
                ans++;
            }else if(tmp > ma){
                ma = tmp;
                ans = 1;
            }
        }
    } while( next_permutation(v.begin(), v.end()) );     // 次の順列を生成
    cout << ans << endl;
    return 0;
}