#include <bits/stdc++.h>
using namespace std;
const int N = 200000;
long long BIT1[200001];
long long BIT2[200001];
int cnt1[200001];
int cnt2[200001];
map<int, int> r, l;
pair<int, int> arr[200001];
int n;
void upd1(int idx, long long val) {
  for (; idx <= N; idx = (idx | (idx + 1))) {
    BIT1[idx] += val;
    cnt1[idx]++;
  }
}
void upd2(int idx, long long val) {
  for (; idx <= N; idx = (idx | (idx + 1))) {
    BIT2[idx] += val;
    cnt2[idx]++;
  }
}
pair<long long, int> query1(int idx) {
  if (idx < 0) return {0, 0};
  long long sum = 0;
  int ct = 0;
  for (; idx >= 0; idx = (idx & (idx + 1)) - 1) {
    sum += BIT1[idx];
    ct += cnt1[idx];
  }
  return {sum, ct};
}
pair<long long, int> query2(int idx) {
  if (idx < 0) return {0, 0};
  long long sum = 0;
  int ct = 0;
  for (; idx >= 0; idx = (idx & (idx + 1)) - 1) {
    sum += BIT2[idx];
    ct += cnt2[idx];
  }
  return {sum, ct};
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> arr[i].first;
  for (int i = 1; i <= n; i++) cin >> arr[i].second;
  sort(arr + 1, arr + n + 1);
  for (int i = 1; i <= n; i++) {
    if (arr[i].second > 0)
      r[arr[i].second] = 0;
    else if (arr[i].second < 0)
      l[-(arr[i].second)] = 0;
  }
  int ind = 1;
  for (auto &it : r) {
    it.second = ind;
    ind++;
  }
  ind = 1;
  for (auto &it : l) {
    it.second = ind;
    ind++;
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    if (arr[i].second >= 0) {
      int vel = r[arr[i].second];
      pair<long long, int> p = query1(vel);
      ans += (p.second) * (arr[i].first);
      ans -= p.first;
      p = query2(N);
      ans += (p.second) * (arr[i].first);
      ans -= p.first;
      upd1(vel, arr[i].first);
    } else if (arr[i].second < 0) {
      int vel = l[-(arr[i].second)];
      pair<long long, int> p = query2(N);
      pair<long long, int> p1 = query2(vel - 1);
      p.first -= p1.first;
      p.second -= p1.second;
      ans += (p.second) * (arr[i].first);
      ans -= p.first;
      upd2(vel, arr[i].first);
    }
  }
  cout << ans;
}
