There are n points on a coordinate axis OX. The i-th point is located at the integer point xi and has a speed vi. 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).

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

The second line of the input contains n integers x1,x2,…,xn (1≤xi≤10⁸), where xi is the initial coordinate of the i-th point. It is guaranteed that all xi are distinct.

The third line of the input contains n integers v1,v2,…,vn (−10⁸≤vi≤10⁸), where vi is the speed of the i-th point.

Print one integer — the value ∑_1≤i<j≤nd(i,j) (the sum of minimum distances over all pairs of points).

样例二：
输入：
5
2 1 4 3 5
2 2 2 3 4
输出：
19


样例三：
输入：
2 
2 1 
-3 0
输出：
0

莫队 数据结构 线段树 树状数组