What Goes Up Must Come Down

Several cards with numbers printed on them are lined up on the table.

We'd like to change their order so that first some are in non-decreasing order of the numbers on them, and the rest are in non-increasing order. For example, (1, 2, 3, 2, 1), (1, 1, 3, 4, 5, 9, 2), and (5, 3, 1) are acceptable orders, but (8, 7, 9) and (5, 3, 5, 3) are not.

To put it formally, with $n$ the number of cards and $b_i$ the number printed on the card at the $i$-th position ($1 \leq i \leq n$) after reordering, there should exist $k \in \\{1, ... n\\}$ such that ($b_i \leq b_{i+1} \forall _i \in \\{1, ... k - 1\\}$) and ($b_i \geq b_{i+1} \forall _i \in \\{k, ..., n - 1\\}$) hold.

For reordering, the only operation allowed at a time is to swap the positions of an adjacent card pair. We want to know the minimum number of swaps required to complete the reorder.

Input

The input consists of a single test case of the following format.


$n$
$a_1$ ... $a_n$


An integer $n$ in the first line is the number of cards ($1 \leq n \leq 100 000$). Integers $a_1$ through $a_n$ in the second line are the numbers printed on the cards, in the order of their original positions ($1 \leq a_i \leq 100 000$).

Output

Output in a line the minimum number of swaps required to reorder the cards as specified.

Sample Input 1


7
3 1 4 1 5 9 2


Sample Output 1


3


Sample Input 2


9
10 4 6 3 15 9 1 1 12


Sample Output 2


8


Sample Input 3


8
9 9 8 8 7 7 6 6


Sample Output 3


0


Sample Input 4


6
8 7 2 5 4 6


Sample Output 4


4






Example

Input

7
3 1 4 1 5 9 2


Output

3
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template <typename T>
class fenwick_tree{
	const int n;
	vector<T> dat;
public:
	fenwick_tree(int n_) : n(n_), dat(n, 0) {}
	void add(int i, T val){
		for(;i < n;i |= i + 1){
			dat[i] += val;
		}
	}
	T sum(int i) const {
		T res = 0;
		for(;i >= 0;i = (i & (i + 1)) - 1){
			res += dat[i];
		}
		return res;
	}
	T sum(int l, int r) const {
		return sum(r - 1) - sum(l - 1);
	}
};

int main()
{
	int n;
	cin >> n;
	vector<int> a(n);
	vector<pair<int, int>> ai;
	for(int i = 0;i < n;i++){
		cin >> a[i];
		ai.emplace_back(a[i], i);
	}
	sort(ai.begin(), ai.end());
	fenwick_tree<int> ft(n);
	for(int i = 0;i < n;i++){
		ft.add(i, 1);
	}
	ll res = 0;
	for(int i = 0;i < n;){
		int val = ai[i].first;
		vector<int> ids;
		while(i < n && ai[i].first == val){
			ft.add(ai[i].second, -1);
			ids.push_back(ai[i++].second);
		}
		for(int id : ids){
			res += min(ft.sum(0, id), ft.sum(id, n));
		}
	}
	cout << res << endl;
	return 0;
}


