#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
bool ckmin(T& a, U& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T, class U>
bool ckmax(T& a, U& b) {
  return a < b ? a = b, 1 : 0;
}
int pct(int x) { return __builtin_popcount(x); }
long long FIRSTTRUE(function<bool(long long)> first, long long lower_bound,
                    long long rb) {
  while (lower_bound < rb) {
    long long mb = (lower_bound + rb) / 2;
    first(mb) ? rb = mb : lower_bound = mb + 1;
  }
  return lower_bound;
}
long long LASTTRUE(function<bool(long long)> first, long long lower_bound,
                   long long rb) {
  while (lower_bound < rb) {
    long long mb = (lower_bound + rb + 1) / 2;
    first(mb) ? lower_bound = mb : rb = mb - 1;
  }
  return lower_bound;
}
namespace input {
template <class T>
void re(complex<T>& x);
template <class T1, class T2>
void re(pair<T1, T2>& p);
template <class T>
void re(vector<T>& a);
template <class T, size_t SZ>
void re(array<T, SZ>& a);
template <class T>
void re(T& x) {
  cin >> x;
}
void re(double& x) {
  string t;
  re(t);
  x = stod(t);
}
void re(long double& x) {
  string t;
  re(t);
  x = stold(t);
}
template <class T, class... Ts>
void re(T& t, Ts&... ts) {
  re(t);
  re(ts...);
}
template <class T>
void re(complex<T>& x) {
  T a, b;
  re(a, b);
  x = {a, b};
}
template <class T1, class T2>
void re(pair<T1, T2>& p) {
  re(p.first, p.second);
}
template <class T>
void re(vector<T>& a) {
  for (int i = (0); i < ((int)a.size()); ++i) re(a[i]);
}
template <class T, size_t SZ>
void re(array<T, SZ>& a) {
  for (int i = (0); i < (SZ); ++i) re(a[i]);
}
}  // namespace input
using namespace input;
namespace output {
void pr(int x) { cout << x; }
void pr(long x) { cout << x; }
void pr(long long x) { cout << x; }
void pr(unsigned x) { cout << x; }
void pr(unsigned long x) { cout << x; }
void pr(unsigned long long x) { cout << x; }
void pr(float x) { cout << x; }
void pr(double x) { cout << x; }
void pr(long double x) { cout << x; }
void pr(char x) { cout << x; }
void pr(const char* x) { cout << x; }
void pr(const string& x) { cout << x; }
void pr(bool x) { pr(x ? "true" : "false"); }
template <class T>
void pr(const complex<T>& x) {
  cout << x;
}
template <class T1, class T2>
void pr(const pair<T1, T2>& x);
template <class T>
void pr(const T& x);
template <class T, class... Ts>
void pr(const T& t, const Ts&... ts) {
  pr(t);
  pr(ts...);
}
template <class T1, class T2>
void pr(const pair<T1, T2>& x) {
  pr("{", x.first, ", ", x.second, "}");
}
template <class T>
void pr(const T& x) {
  pr("{");
  bool fst = 1;
  for (const auto& a : x) pr(!fst ? ", " : "", a), fst = 0;
  pr("}");
}
void ps() { pr("\n"); }
template <class T, class... Ts>
void ps(const T& t, const Ts&... ts) {
  pr(t);
  if (sizeof...(ts)) pr(" ");
  ps(ts...);
}
void pc() { pr("]\n"); }
template <class T, class... Ts>
void pc(const T& t, const Ts&... ts) {
  pr(t);
  if (sizeof...(ts)) pr(", ");
  pc(ts...);
}
}  // namespace output
using namespace output;
namespace io {
void setIn(string second) { freopen(second.c_str(), "r", stdin); }
void setOut(string second) { freopen(second.c_str(), "w", stdout); }
void setIO(string second = "") {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  if ((int)second.size()) {
    setIn(second + ".in"), setOut(second + ".out");
  }
}
}  // namespace io
using namespace io;
const int MOD = 1000000007;
struct mi {
  typedef decay<decltype(MOD)>::type T;
  T v;
  explicit operator T() const { return v; }
  mi() { v = 0; }
  mi(long long _v) {
    v = (-MOD < _v && _v < MOD) ? _v : _v % MOD;
    if (v < 0) v += MOD;
  }
  friend bool operator==(const mi& a, const mi& b) { return a.v == b.v; }
  friend bool operator!=(const mi& a, const mi& b) { return !(a == b); }
  friend bool operator<(const mi& a, const mi& b) { return a.v < b.v; }
  friend void re(mi& a) {
    long long x;
    re(x);
    a = mi(x);
  }
  friend void pr(const mi& a) { pr(a.v); }
  friend ostream& operator<<(ostream& os, const mi& a) { return os << a.v; }
  mi& operator+=(const mi& m) {
    if ((v += m.v) >= MOD) {
      v -= MOD;
    }
    return *this;
  }
  mi& operator-=(const mi& m) {
    if ((v -= m.v) < 0) {
      v += MOD;
    }
    return *this;
  }
  mi& operator*=(const mi& m) {
    v = (long long)v * m.v % MOD;
    return *this;
  }
  mi& operator/=(const mi& m) { return (*this) *= inv(m); }
  friend mi pow(mi a, long long p) {
    mi ans = 1;
    assert(p >= 0);
    for (; p; p /= 2, a *= a)
      if (p & 1) ans *= a;
    return ans;
  }
  friend mi inv(const mi& a) {
    assert(a.v != 0);
    return pow(a, MOD - 2);
  }
  mi operator-() const { return mi(-v); }
  mi& operator++() { return *this += 1; }
  mi& operator--() { return *this -= 1; }
  friend mi operator+(mi a, const mi& b) { return a += b; }
  friend mi operator-(mi a, const mi& b) { return a -= b; }
  friend mi operator*(mi a, const mi& b) { return a *= b; }
  friend mi operator/(mi a, const mi& b) { return a /= b; }
};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
const int MAX = 200001;
template <class T>
struct BIT {
  T bit[MAX];
  long long SZ;
  BIT(T n) { SZ = n; }
  void update(T pos, T val) {
    while (pos <= SZ) {
      bit[pos] += val;
      pos += pos & -pos;
    }
  }
  T sum(long long ind) {
    T res = 0;
    while (ind > 0) {
      res += bit[ind];
      ind -= ind & -ind;
    }
    return res;
  }
  T query(T l, T r) { return sum(r) - sum(l - 1); }
};
struct node {
  long long loc, fast, ind;
  node(long long l, long long first, long long i) {
    loc = l, fast = first, ind = i;
  }
};
bool cmp(node a, node b) { return a.loc < b.loc; }
int main() {
  long long n;
  cin >> n;
  vector<long long> pos(n + 1, 0), speed(n + 1, 0);
  for (int i = (1); i < (n + 1); ++i) {
    cin >> pos[i];
  }
  for (int i = (1); i < (n + 1); ++i) {
    cin >> speed[i];
  }
  vector<node> a(n + 1, {0, 0, 0});
  for (int i = (1); i < (n + 1); ++i) {
    a[i] = {pos[i], speed[i], (long long)i};
  }
  long long curid = 1;
  vector<long long> s1 = speed;
  sort(s1.begin() + 1, s1.end());
  map<long long, long long> track;
  for (int i = 1; i <= n; i++) {
    track[s1[i]] = curid++;
  }
  for (int i = (1); i < (n + 1); ++i) {
    a[i].ind = track[a[i].fast];
  }
  BIT<long long> inv(n), inv1(n);
  sort(1 + a.begin(), a.end(), cmp);
  long long ans = 0;
  for (int i = n; i >= 1; i--) {
    auto pos1 = lower_bound(s1.begin() + 1, s1.end(), a[i].fast) - s1.begin();
    long long qry = inv.query(pos1, n);
    long long qry1 = inv1.query(pos1, n);
    ans += (qry - (qry1 * a[i].loc));
    inv.update(a[i].ind, a[i].loc);
    inv1.update(a[i].ind, 1);
  }
  cout << ans << '\n';
}
