#include <bits/stdc++.h>
using namespace std;
const int M = 200005;
int n, m, w[M];
long long ans, c[M][2];
struct node {
  int x, v;
} p[M];
bool cmp(node a, node b) { return a.x < b.x; }
long long query(int x, int t) {
  long long r = 0;
  for (int i = x; i; i -= i & -i) r += c[i][t];
  return r;
}
void upd(int x, int y) {
  for (int i = x; i <= m; i += i & -i) c[i][0]++, c[i][1] += y;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &p[i].x);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i].v);
    w[i] = p[i].v;
  }
  sort(p + 1, p + 1 + n, cmp);
  sort(w + 1, w + 1 + n);
  m = unique(w + 1, w + 1 + n) - (w + 1);
  for (int i = 1; i <= n; i++) {
    int a = lower_bound(w + 1, w + 1 + m, p[i].v) - w;
    ans += query(a, 0) * p[i].x - query(a, 1);
    upd(a, p[i].x);
  }
  printf("%lld", ans);
  return 0;
}

### Prompt

In CPP, your task is to solve 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 M = 200005;
int n, m, w[M];
long long ans, c[M][2];
struct node {
  int x, v;
} p[M];
bool cmp(node a, node b) { return a.x < b.x; }
long long query(int x, int t) {
  long long r = 0;
  for (int i = x; i; i -= i & -i) r += c[i][t];
  return r;
}
void upd(int x, int y) {
  for (int i = x; i <= m; i += i & -i) c[i][0]++, c[i][1] += y;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &p[i].x);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i].v);
    w[i] = p[i].v;
  }
  sort(p + 1, p + 1 + n, cmp);
  sort(w + 1, w + 1 + n);
  m = unique(w + 1, w + 1 + n) - (w + 1);
  for (int i = 1; i <= n; i++) {
    int a = lower_bound(w + 1, w + 1 + m, p[i].v) - w;
    ans += query(a, 0) * p[i].x - query(a, 1);
    upd(a, p[i].x);
  }
  printf("%lld", ans);
  return 0;
}

```