/*
 author : Anubhav Dinesh Patel
 date : 14.11.2020 01:17:17 IST 
*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end() 
#define max_pqueue priority_queue< long long >
#define min_pqueue priority_queue< long long , vector<long long> , greater< long long >>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vl vector<long long>
#define vll vector<pair<long long, long long>>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define gcase "Case #"<<tcase<<": "
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
// typedef tree<int, int, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_map;

//~ setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//~ setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
//~ setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
//~ cout.precision(x)  cout<<fixed<<val;  // prints x digits after decimal in val

#ifndef LOCAL_MACHINE
#define cerr if (false) cerr
#endif

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
template<typename T>
void _printA(T *t, long long sz) { cout<<" { "; for (long long i=0; i<sz; i++) cout<<"["<<i<<"] = "<< t[i]<<endl; cout<<" } \n";}
#ifdef LOCAL_MACHINE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#define debugA(x, y) cerr << "[" << #x << "] = "; _printA(x, y)
#else
#define debug(x...)
#define debugA(x, y)
#endif

const ll _MOD = 1e9 + 7LL;

ll mod(ll a, ll m=_MOD) {
	return ((a % m) + m) % m;
}

ll gcd(ll a, ll b) { return __gcd(a, b); }

ll gcd(ll a, ll b, ll & x, ll & y) {
    if (a == 0) {
        x = 0;
        y = 1;
        return b;
    }
    ll x1, y1;
    ll d = gcd(b % a, a, x1, y1);
    x = y1 - (b / a) * x1;
    y = x1;
    return d;
}

ll modinv(ll a, ll m=_MOD) {
	ll x, y;
	gcd(a, m, x, y);
	x = (x % m + m) % m;
    return x;
}

ll powm(ll a, ll b, ll m=_MOD) {
	if (b == 0) return 1;
	ll ans = powm(a, b/2, m);
	ans = (ans * ans) % m;
	return (b & 1) ? (ans * (a%m)) % m : ans;
}

/* 1. If you can't keep solution in mind, then visualize it on a paper.
 * 2. Try to identify the type of problem - DP, Greedy, Graph, Constructive, 
 * 	  Prefix/Suffix, Difference Array, BIT/Segment Tree, etc.
 * 3. Look at the problems from different perspectives - reverse the problem, 
 * 	  add instead of delete (maybe?)
 * 4. Divide difficult solutions into cases and/or sequences.
 * 5. Use math rules to solve Nested Summation.
 * 6. Optimisation problems are generally solved with DP, greedy, binary search or brute-force.
 * 7. Try fixing a solution then proving we can't do better or worse than that.
 * ------------------------------------------------------------------ 
 */

template<class T>
struct BIT {
   vector<T> bit;
   int n;
 
   BIT(int n) {
       this->n = n;
       bit.assign(n, 0);
   }
 
   BIT(vector<T> a) : BIT(a.size()) {
       for (size_t i = 0; i < a.size(); i++)
           add(i, a[i]);
   }
 
   T sum(int r) {
       T ret = 0;
       for (; r >= 0; r = (r & (r + 1)) - 1)
           ret += bit[r];
       return ret;
   }
 
   T sum(int l, int r) {
       return sum(r) - sum(l - 1);
   }
 
   void add(int idx, T delta) {
       for (; idx < n; idx = idx | (idx + 1))
           bit[idx] += delta;
   }
};


void solve() {
	int n;
	cin>>n;
	vector<ll> X(n), V(n);
	map<ll, ll> xv;
	for (int i=0; i<n; i++)
		cin>>X[i];
	for (int i=0; i<n; i++)
		cin>>V[i];
		
	for (int i=0; i<n; i++)
		xv[X[i]] = V[i];
		
	vector<ll> pos_v, neg_v;
	for (auto v : V)
		if (v >= 0)
			pos_v.push_back(v);
		else
			neg_v.push_back(v);
		
	sort(all(pos_v));
	sort(all(neg_v));
	
	ll ans = 0;
	
	//pos
	ll neg_count = 0, neg_sum = 0; 
	BIT<ll> bit_count(sz(pos_v)), bit_sum(sz(pos_v));
	for (auto [x, v] : xv) {
		if (v >= 0) {
			ans += (x*neg_count - neg_sum);
			int idx = lower_bound(all(pos_v), v) - pos_v.begin();
			ans += (x*bit_count.sum(idx) - bit_sum.sum(idx));
			
			bit_count.add(idx, 1);
			bit_sum.add(idx, x);
		}
		else {
			neg_count++;
			neg_sum += x;
		}
	}
	
	//neg
	{
		BIT<ll> bit_count(sz(neg_v)), bit_sum(sz(neg_v));
		for (auto [x, v] : xv) {
			if (v < 0) {
				int idx = lower_bound(all(neg_v), v) - neg_v.begin();
				ans += (x*bit_count.sum(idx, sz(neg_v) - 1) - bit_sum.sum(idx, sz(neg_v) - 1));
			
				bit_count.add(idx, 1);
				bit_sum.add(idx, x);
			}
		}
	}
	
	cout<<ans<<endl;	
}

void preprocess() {

}

int main() {
#ifdef LOCAL_MACHINE
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-result"
freopen("in", "r", stdin);
#pragma GCC diagnostic pop
#endif

	fast_io;
	preprocess();
	int T;
	T = 1;
	// cin>>T;
	for (int t=1; t<=T; t++) {
		solve();
	}
}	
