#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod=1e9+7;
const ll INF = 10000000000000;
const int N = 1e6+7;
void solve() {
int n;
cin >> n;
vector<pair<int,int>> a(n);
for(int i=0;i<n;i++) cin >> a[i].first;
for(int i=0;i<n;i++) cin >> a[i].second;
vector<int> ch(n);
for(int i=0;i<n;i++) ch[i]=a[i].first-a[i].second;
sort(ch.begin(),ch.end());
int l=0,r=n-1;
int ans = 0;
while(l<=r){
if(ch[l]+ch[r]>0){
ans+=r-l;
r--;
}
else l++;
}
cout << ans << '\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
/*int t;
cin >> t;
while (t--)*/ solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwpjb25zdCBpbnQgTW9kPTFlOSs3Owpjb25zdCBsbCBJTkYgPSAxMDAwMDAwMDAwMDAwMDsKY29uc3QgaW50IE4gPSAxZTYrNzsKCiAgICB2b2lkIHNvbHZlKCkgewogICAgICAgIGludCBuOwogICAgICAgIGNpbiA+PiBuOwogICAgICAgIHZlY3RvcjxwYWlyPGludCxpbnQ+PiBhKG4pOwogICAgICAgIGZvcihpbnQgaT0wO2k8bjtpKyspIGNpbiA+PiBhW2ldLmZpcnN0OwogICAgICAgIGZvcihpbnQgaT0wO2k8bjtpKyspIGNpbiA+PiBhW2ldLnNlY29uZDsKICAgICAgICB2ZWN0b3I8aW50PiBjaChuKTsKICAgICAgICBmb3IoaW50IGk9MDtpPG47aSsrKSBjaFtpXT1hW2ldLmZpcnN0LWFbaV0uc2Vjb25kOwogICAgICAgIHNvcnQoY2guYmVnaW4oKSxjaC5lbmQoKSk7CiAgICAgICAgaW50IGw9MCxyPW4tMTsKICAgICAgICBpbnQgYW5zID0gMDsKICAgICAgICB3aGlsZShsPD1yKXsKICAgICAgICAgICBpZihjaFtsXStjaFtyXT4wKXsKICAgICAgICAgICAgICBhbnMrPXItbDsKICAgICAgICAgICAgICByLS07ICAKICAgICAgICAgICB9CiAgICAgICAgICAgZWxzZSBsKys7CiAgICAgICAgfQogICAgICAgIGNvdXQgPDwgYW5zIDw8ICdcbic7CiAgICB9CgppbnQgbWFpbigpeyAKICAgIGlvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKICAgIGNpbi50aWUobnVsbHB0cik7CgkKICAgIC8qaW50IHQ7CiAgICBjaW4gPj4gdDsKICAgIHdoaWxlICh0LS0pKi8gc29sdmUoKTsKICAgIAogICAgcmV0dXJuIDA7Cn0K