//Judges with GCC >= 12 only needs Ofast
#pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
 #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include<bits/stdc++.h>
#define int long long
//#include "sqsort.h"
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int mod2=  998244353;
const int  mod=1e9+7;
struct ib
{
    int a;
    int b;
};
struct icd
{
    int a,b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
int n,m,s2,s4,s3,sf,k,r,dem=0,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,l;
int  i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
//fin(task),fou(task);
#endif
    NHP
//modwwe
    phongbeo(),down
    //checktime
}
ib a[1000001];
int bit[3000002],bit2[3000002],bit3[3000002],bit4[3000002];
void add2(int x,int y)
{
    for(x;x>=1000001;x-=x&-x)
        bit2[x]+=y,bit[x]++;
}
void add3(int x,int y)
{
  for(x;x;x-=x&-x)
        bit3[x]+=y,bit4[x]++;
}
int get1(int x,int y)
{
     int ss=0,ss2=0,ss4=y;
      for(x;x<=s2;x+=x&-x)
      {
          ss2+=bit[x];
          ss+=bit2[x];
      }
      return ss4*ss2-ss;
}
int get2(int x,int y)
{
     int ss=0,ss2=0,ss4=y;
      for(x;x<=s2;x+=x&-x)
      {
          ss2+=bit4[x];
          ss+=bit3[x];
      }
      return ss4*ss2-ss;
 
}
bool cmp(ib a,ib b)
{
    return a.a<b.a;
}
void phongbeo()
{
    cin>>n;
     for(int i=1;i<=n;i++)
        cin>>a[i].a,a[i].a+=1000001;
     for(int i=1;i<=n;i++)
         cin>>a[i].b,s2=max(s2,a[i].a+a[i].b);
sort(a+1,a+1+n,cmp);
         for(int i=1;i<=n;i++)
         { s4=a[i].a-a[i].b;
         s5=a[i].a+a[i].b;
         s3+=get1(s5,a[i].a);
         s3+=get2(s4,a[i].a);
         add2(s5,a[i].a);
         add3(s4,a[i].a);
         }
         for(int i=1;i<=n;i++)
 {
     a[i].a-=1000001;
     swap(a[i].a,a[i].b);
     a[i].a+=1000001;
 }
 sort(a+1,a+1+n,cmp);
 memset(bit,0,sizeof bit);
  memset(bit2,0,sizeof bit);
 memset(bit3,0,sizeof bit);
 memset(bit4,0,sizeof bit);
 
  for(int i=1;i<=n;i++)
         { s4=a[i].a-a[i].b;
         s5=a[i].a+a[i].b;
         s3+=get1(s5+1,a[i].a);
         s3+=get2(s4+1,a[i].a);
         add2(s5,a[i].a);
         add3(s4,a[i].a);
         }
         cout<<s3*2;
}