#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
const int MOD = 998244353;
const int INF = 0x3f3f3f3f;
struct Node {
  int x;
  int v;
} a[MAXN];
bool cmp(Node a, Node b) {
  if (a.v == b.v) {
    return a.x < b.x;
  }
  return a.v < b.v;
}
int N, M;
vector<int> dic;
int main() {
  int now;
  long long ans;
  while (~scanf("%d", &N)) {
    dic.clear();
    for (int i = 0; i < N; i++) {
      scanf("%d", &a[i].x);
      dic.push_back(a[i].x);
    }
    for (int i = 0; i < N; i++) {
      scanf("%d", &a[i].v);
    }
    sort(a, a + N, cmp);
    sort(dic.begin(), dic.end());
    ans = 0;
    for (int i = 0; i < N; i++) {
      now = upper_bound(dic.begin(), dic.end(), a[i].x) - dic.begin();
      ans += (long long)(now - N + i) * a[i].x;
    }
    printf("%lld\n", ans);
  }
  return 0;
}

### Prompt

Your challenge is to write a cpp solution to the following problem:

There are n points on a coordinate axis OX. The i-th point is located at the integer point x_i and has a speed v_i. It is guaranteed that no two points occupy the same coordinate. All n points move with the constant speed, the coordinate of the i-th point at the moment t (t can be non-integer) is calculated as x_i + t ⋅ v_i.

Consider two points i and j. Let d(i, j) be the minimum possible distance between these two points over any possible moments of time (even non-integer). It means that if two points i and j coincide at some moment, the value d(i, j) will be 0.

Your task is to calculate the value ∑_{1 ≤ i < j ≤ n} d(i, j) (the sum of minimum distances over all pairs of points).

Input

The first line of the input contains one integer n (2 ≤ n ≤ 2 ⋅ 10^5) — the number of points.

The second line of the input contains n integers x_1, x_2, ..., x_n (1 ≤ x_i ≤ 10^8), where x_i is the initial coordinate of the i-th point. It is guaranteed that all x_i are distinct.

The third line of the input contains n integers v_1, v_2, ..., v_n (-10^8 ≤ v_i ≤ 10^8), where v_i is the speed of the i-th point.

Output

Print one integer — the value ∑_{1 ≤ i < j ≤ n} d(i, j) (the sum of minimum distances over all pairs of points).

Examples

Input


3
1 3 2
-100 2 3


Output


3


Input


5
2 1 4 3 5
2 2 2 3 4


Output


19


Input


2
2 1
-3 0


Output


0

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
const int MOD = 998244353;
const int INF = 0x3f3f3f3f;
struct Node {
  int x;
  int v;
} a[MAXN];
bool cmp(Node a, Node b) {
  if (a.v == b.v) {
    return a.x < b.x;
  }
  return a.v < b.v;
}
int N, M;
vector<int> dic;
int main() {
  int now;
  long long ans;
  while (~scanf("%d", &N)) {
    dic.clear();
    for (int i = 0; i < N; i++) {
      scanf("%d", &a[i].x);
      dic.push_back(a[i].x);
    }
    for (int i = 0; i < N; i++) {
      scanf("%d", &a[i].v);
    }
    sort(a, a + N, cmp);
    sort(dic.begin(), dic.end());
    ans = 0;
    for (int i = 0; i < N; i++) {
      now = upper_bound(dic.begin(), dic.end(), a[i].x) - dic.begin();
      ans += (long long)(now - N + i) * a[i].x;
    }
    printf("%lld\n", ans);
  }
  return 0;
}

```