#include <bits/stdc++.h>
using namespace std;
bool isprime(long long int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
vector<long long int> prime;
void sieve(long long int n) {
  bool bakh[n + 1];
  memset(bakh, true, sizeof(bakh));
  for (long long int p = 2; p * p <= n; p++) {
    if (bakh[p] == true) {
      for (long long int i = p * p; i <= n; i += p) bakh[i] = false;
    }
  }
  for (long long int p = 2; p <= n; p++)
    if (bakh[p]) prime.push_back(p);
}
long long int eulertotient(long long int z) {
  long long int fac = z;
  for (long long int i = 0; prime[i] * prime[i] <= z; i++) {
    if (z % prime[i] == 0) {
      fac -= (fac / prime[i]);
      while (z % prime[i] == 0) z /= prime[i];
    }
  }
  if (z > 1) fac -= (fac / z);
  return fac;
}
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  long long int g = gcd(a, b);
  long long int ans = (a * b) / g;
  return ans;
}
long long int modInverse(long long int a, long long int m) {
  long long int hvf = gcd(a, m);
  if (hvf == 1) return power(a, m - 2, m);
  return -1;
}
void multiply(long long int F[2][2], long long int M[2][2]) {
  long long int x = F[0][0] * M[0][0] + F[0][1] * M[1][0];
  long long int y = F[0][0] * M[0][1] + F[0][1] * M[1][1];
  long long int z = F[1][0] * M[0][0] + F[1][1] * M[1][0];
  long long int w = F[1][0] * M[0][1] + F[1][1] * M[1][1];
  F[0][0] = x;
  F[0][1] = y;
  F[1][0] = z;
  F[1][1] = w;
}
void powermat(long long int F[2][2], long long int n) {
  if (n == 0 || n == 1) return;
  long long int M[2][2] = {{1, 1}, {1, 0}};
  powermat(F, n / 2);
  multiply(F, F);
  if (n % 2 != 0) multiply(F, M);
}
long long int fib(long long int n) {
  long long int F[2][2] = {{1, 1}, {1, 0}};
  if (n == 0) return 0;
  powermat(F, n - 1);
  return F[0][0];
}
long long int dp[200005];
long long int countLarger[200005];
void countLargerRight(vector<pair<long long int, long long int> > A,
                      long long int len) {
  set<int> s;
  for (int i = len - 1; i >= 0; i--) {
    s.insert(A[i].second);
    auto it = s.upper_bound(A[i].second);
    countLarger[i] = s.size() - distance(s.begin(), it);
  }
}
bool comp(pair<long long int, long long int> a,
          pair<long long int, long long int> b) {
  if (a.first == b.first) return 1;
  return a.first < b.first;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int n;
  cin >> n;
  long long int ar[n];
  for (long long int i = 0; i < n; i++) cin >> ar[i];
  long long int av[n];
  vector<long long int> l, r;
  for (long long int i = 0; i < n; i++) cin >> av[i];
  vector<pair<long long int, long long int> > low, high;
  for (long long int i = 0; i < n; i++) {
    if (av[i] <= 0)
      l.push_back(ar[i]), low.push_back({ar[i], abs(av[i])});
    else
      r.push_back(ar[i]), high.push_back({ar[i], av[i]});
  }
  long long int ans = 0, sz = r.size();
  if (r.size() > 0) {
    dp[sz - 1] = r[sz - 1];
    for (long long int i = sz - 2; i >= 0; i--) dp[i] = dp[i + 1] + r[i];
    for (long long int i = 0; i < l.size(); i++) {
      long long int tx = upper_bound(r.begin(), r.end(), l[i]) - r.begin();
      if (tx == r.size()) continue;
      long long int p = r.size() - tx;
      ans += dp[tx] - p * (l[i]);
    }
  }
  sort(low.begin(), low.end(), comp);
  sort(high.begin(), high.end(), comp);
  long long int p = 0;
  for (long long int i = 0; i < low.size(); i++) {
    for (long long int j = 0; j < i; j++) {
      if (low[j].second >= low[i].second) p += abs(low[i].first - low[j].first);
    }
    for (long long int j = i + 1; j < low.size(); j++) {
      if (low[j].second <= low[i].second) p += abs(low[i].first - low[j].first);
    }
  }
  ans += p / 2;
  p = 0;
  for (long long int i = 0; i < high.size(); i++) {
    for (long long int j = 0; j < i; j++) {
      if (high[j].second <= high[i].second)
        p += abs(high[j].first - high[i].first);
    }
    for (long long int j = i + 1; j < high.size(); j++) {
      if (high[j].second >= high[i].second)
        p += abs(high[j].first - high[i].first);
    }
  }
  ans += p / 2;
  cout << ans << endl;
}
