#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
    int n;
    cin>>n;
    vector<long long>a(n);
    vector<long long>b(n);
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i++)cin>>b[i];
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    vector<long long>::iterator low;
    long long p;
    long long sum=0;
    for(int i=0;i<n;i++){
        low=upper_bound(b.begin(),b.end(),a[i]);///ako su isti sabiram
        p=low-b.begin();
        sum+=(2*p-n)*a[i];

    }
    for(int i=0;i<n;i++){
        low=upper_bound(a.begin(),a.end(),b[i]-1);///ako su isti oduzimam ih
        p=low-a.begin();
        sum+=(2*p-n)*b[i];
    }
    cout<<sum;
    return 0;
}