#include <bits/stdc++.h>
 
using namespace std;

int n,t;
vector <int> a,b;
map <int,int> cnt;

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> n;
    for(int i=0;i<n;i++)
    {
        cin >> t;
        a.push_back(t);
    }
    for(int i=0;i<n;i++)
    {
        cin >> t;
        b.push_back(t);
    }

    long long int sum = 0;

    vector <int> perm;
    for(int i=0;i<n;i++)
    {
        perm.push_back(i);
    }

    do
    {
        long long int score = 0;
        for(int i=0;i<perm.size();i++)
        {
            if(a[perm[i]] > b[i])
            {
                score += a[perm[i]] - b[i];
            }
        }
        sum = max(sum,score);
        cnt[score] += 1;
    } while (next_permutation(perm.begin(),perm.end()));
    

    cout << cnt[sum] << '\n';

    return 0;
}