#include<bits/stdc++.h>
#include"shoes.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 2e5 + 5;

struct BIT
{
	int tree[MAXN], n;
	#define lowbit(x) ((x)&-(x))
	inline void update(int x,int k)
	{
		while(x<=n)
			tree[x] += k, x += lowbit(x);
	}
	inline int query(int x)
	{
		int res = 0;
		while(x)
			res += tree[x], x ^= lowbit(x);
		return res;
	}
	inline int query(int l,int r)
	{
		return l <= r? query(r) - query(l-1): 0;
	}
}tree1, tree2;

ll count_swaps(vector<int> a)
{
	int n = (int)a.size();
	a.insert(a.begin(), 0);
	
	ll ans = 0;
	
	tree1.n = tree2.n = n;
	
	static int bak[MAXN];
	for(int i=1; i<=n; ++i)
	{
		int x = abs(a[i]);
		if(!bak[x])
		{
			if(a[i] > 0) ++ans;
			bak[x] = i;
			tree1.update(i, 1);
			continue;
		}
		
		ans += tree1.query(bak[x] + 1, i - 1);
		ans += tree2.query(bak[x] + 1, i - 1) * 2;
		
		tree1.update(bak[x], -1);
		tree2.update(bak[x], 1);
	}
	
	return ans;
}