#include<bits/stdc++.h>
using namespace std;
long long n,x,a[1005],b[1005],k,sum,cnt1,cnt2,cnt3;
int main(){
cin>>n;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1;i <= n; i++){
cin >> x;
if(x < a[i]) cnt1++;
if(x > a[i]) cnt2++;
if(x == a[i]) cnt3++;
if(x > a[i])
b[++k] = x - a[i] + 1;
}
if(cnt1 > cnt2)
cout << 0 << endl;
else{
sort(b + 1,b + k + 1);
int step = cnt2-cnt1;
if(step < cnt3)
cout<<step+1<<endl;
else{
sum += cnt3;
step -= cnt3;
step = step/2+1;
for(int i = 1; i <= step; i++)
sum += b[i];
cout << sum << endl;
}
}
return 0;
}