#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma warning(disable : 4996)
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;++i)
#define REPR(i, n) for(int i = n-1;i >= 0;--i)
#define FOR(i, m, n) for(int i = m;i < n;++i)
#define FORR(i, m, n) for(int i = m-1;i >= n;--i)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define pb(a) push_back
#define print(x) cout<<(x)<<'\n'
#define pe(x) cout<<(x)<<" "
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define lb(v,n) lower_bound(v.begin(), v.end(), (n))
#define ub(v,n) upper_bound(v.begin(), v.end(), (n))
//#define int long long
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i,v.size())cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template<typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int>P;
const int MOD = 1e9 + 7; const int MAX = 200020;
const double pi = acos(-1); const double EPS = 1e-12;
const ll INF = 1e18;
template<class VAL> struct RBST {
	VAL SUM_UNITY = 0;                              // to be set

	unsigned int randInt() {
		static unsigned int tx = 123456789, ty = 362436069, tz = 521288629, tw = 88675123;
		unsigned int tt = (tx ^ (tx << 11));
		tx = ty; ty = tz; tz = tw;
		return (tw = (tw ^ (tw >> 19)) ^ (tt ^ (tt >> 8)));
	}

	struct NODE {
		NODE *left, *right;
		VAL val;                        // the value of the node
		int size;                       // the size of the subtree 
		VAL sum;                        // the value-sum of the subtree

		NODE() : val(SUM_UNITY), size(1), sum(SUM_UNITY) {
			left = right = NULL;
		}

		NODE(VAL v) : val(v), size(1), sum(v) {
			left = right = NULL;
		}

		/* additional update */
		inline void update() {

		}

		/* additional lazy-propagation */
		inline void push() {

			/* ex: reverse */
			/*
			if (this->rev) {
			swap(this->left, this->right);
			if (this->left) this->left->rev ^= true;
			if (this->right) this->right->rev ^= true;
			this->rev = false;
			}
			*/
		}
	};


	///////////////////////
	// root
	///////////////////////

	NODE* root;
	RBST() : root(NULL) { }
	RBST(NODE* node) : root(node) { }


	///////////////////////
	// basic operations
	///////////////////////

	/* size */
	inline int size(NODE *node) {
		return !node ? 0 : node->size;
	}
	inline int size() {
		return this->size(this->root);
	}

	/* sum */
	inline VAL sum(NODE *node) {
		return !node ? SUM_UNITY : node->sum;
	}
	inline VAL sum() {
		return this->sum(this->root);
	}

	/* update, push */
	inline NODE* update(NODE *node) {
		node->size = size(node->left) + size(node->right) + 1;
		node->sum = sum(node->left) + sum(node->right) + node->val;
		node->update();
		return node;
	}

	inline void push(NODE *node) {
		if (!node) return;
		node->push();
	}

	/* lower_bound */
	inline int lowerBound(NODE *node, VAL val) {
		push(node);
		if (!node) return 0;
		if (val <= node->val) return lowerBound(node->left, val);
		else return size(node->left) + lowerBound(node->right, val) + 1;
	}
	inline int lowerBound(VAL val) {
		return this->lowerBound(this->root, val);
	}

	/* upper_bound */
	inline int upperBound(NODE *node, VAL val) {
		push(node);
		if (!node) return 0;
		if (val >= node->val) return size(node->left) + upperBound(node->right, val) + 1;
		else return upperBound(node->left, val);
	}
	inline int upperBound(VAL val) {
		return this->upperBound(this->root, val);
	}

	/* count */
	inline int count(VAL val) {
		return upperBound(val) - lowerBound(val);
	}

	/* get --- k: 0-index */
	inline VAL get(NODE *node, int k) {
		push(node);
		if (!node) return -1;
		if (k == size(node->left)) return node->val;
		if (k < size(node->left)) return get(node->left, k);
		else return get(node->right, k - size(node->left) - 1);
	}
	inline VAL get(int k) {
		return get(this->root, k);
	}


	///////////////////////
	// merge-split
	///////////////////////

	NODE* merge(NODE *left, NODE *right) {
		push(left);
		push(right);
		if (!left || !right) {
			if (left) return left;
			else return right;
		}
		if (randInt() % (left->size + right->size) < left->size) {
			left->right = merge(left->right, right);
			return update(left);
		}
		else {
			right->left = merge(left, right->left);
			return update(right);
		}
	}
	void merge(RBST add) {
		this->root = this->merge(this->root, add.root);
	}
	pair<NODE*, NODE*> split(NODE* node, int k) { // [0, k), [k, n)
		push(node);
		if (!node) return make_pair(node, node);
		if (k <= size(node->left)) {
			pair<NODE*, NODE*> sub = split(node->left, k);
			node->left = sub.second;
			return make_pair(sub.first, update(node));
		}
		else {
			pair<NODE*, NODE*> sub = split(node->right, k - size(node->left) - 1);
			node->right = sub.first;
			return make_pair(update(node), sub.second);
		}
	}
	RBST split(int k) {
		pair<NODE*, NODE*> sub = split(this->root, k);
		this->root = sub.first;
		return RBST(sub.second);
	}


	///////////////////////
	// insert-erase
	///////////////////////

	void insert(const VAL val) {
		pair<NODE*, NODE*> sub = this->split(this->root, this->lowerBound(val));
		this->root = this->merge(this->merge(sub.first, new NODE(val)), sub.second);
	}

	void erase(const VAL val) {
		if (!this->count(val)) return;
		pair<NODE*, NODE*> sub = this->split(this->root, this->lowerBound(val));
		this->root = this->merge(sub.first, this->split(sub.second, 1).second);
	}


	///////////////////////
	// debug
	///////////////////////

	//void print(NODE *node) {
	//	if (!node) return;
	//	push(node);
	//	print(node->left);
	//	cout << node->val << " ";
	//	print(node->right);
	//}
	//void print() {
	//	cout << "{";
	//	print(this->root);
	//	cout << "}" << endl;
	//}
};


void solve() {
	int N; cin >> N;
	vector<P>v(N);
	REP(i, N) {
		cin >> v[i].first;
	}
	REP(i, N)cin >> v[i].second;
	VSORT(v);
	ll sum = 0;
	REP(i, N) {
		sum += i * v[i].first;
		sum -= (N - i - 1)*v[i].first;
	}
	//DEBUG(sum);
	RBST<int>S;
	REPR(i, N) {
		int c = S.lowerBound(v[i].second) - S.lowerBound(-1e8 - 1);
		sum += c * v[i].first;
		//cout << v[i].second << " " << c << endl;
		S.insert(v[i].second);
	}
	RBST<int>S2;
	REP(i, N) {
		int c = S2.upperBound(1e8 + 1) - S2.upperBound(v[i].second);
		sum -= c * v[i].first;
		//cout << v[i].second << " " << c << endl;
		S2.insert(v[i].second);
	}
	print(sum);
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q; cin >> q;
	//while (q--)
	solve();
}
