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

 
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll,ll> P;
typedef string str;
typedef vector<P> vp;
typedef vector<str> vs;
typedef map<ll,ll> mp;
typedef set<ll> st;

const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1e18;

#define rep(i,m,n) for(ll i=m;i<n;i++)
#define repr(i,m,n) for(ll i=m-1;i>=n;i--)
#define fi first
#define se second
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define eb(x) emplace_back(x)
#define pb(x) pop_back(x)
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define lb(x,a) lower_bound(all(x),a)
#define ub(x,a) upper_bound(all(x),a)
#define maxe(x) max_element(all(x))
#define mine(x) min_element(all(x))
#define pc(x) __builtin_popcount(x)
#define np(x) next_permutation(all(x))



void solve(){
  ll n;
  cin >> n;
  vll a(n),b(n);
  rep(i,0,n) cin >> a[i];
  rep(i,0,n) cin >> b[i];
  
  vll v;
  vll num(n);
  iota(all(num),0);
  do{
    ll tot=0;
   rep(i,0,n) tot+=max(0ll,a[num[i]]-b[i]);
    v.eb(tot);
  }while(np(num));
  
  sort(all(v));
  
  cout << ub(v,v.back())-lb(v,v.back()) << endl;
}
int main(){
   cin.tie(nullptr);
  ios::sync_with_stdio(false);
  solve();
}