#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}


signed main(){
    map<ll,ll> mp;
    int n;cin>>n;
    vector<ll> b(n);
    vector<pair<ll,ll>> a(n);
    rep(i,n){
        ll t;cin>>t;
        a[i]={t,i};
    }
    cin>>b;


    sort(ALL(a));
    do{
        ll res=0;
        rep(i,n){
            res+=max(0ll,a[i].first-b[i]);
        }
        mp[res]++;
    }while(next_permutation(ALL(a)));

    ll x=-194281,y=0;
    for(auto [u,v]:mp){
        if(chmax(x,u)) y=v;
    }
    cout<<y<<endl;
    return 0;
}