#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
template<class T> using Vec = std::vector<T>;
#define L(i, l, r) for (int i = (l); i < (r); ++i)
#define R(i, l, r) for (int i = (r - 1); i >= (l); --i)
#define sz(s) (int)(std::size(s))

int n;
Vec<int> s;
Vec<int> lpos,rpos;

struct BIT {
	int n;
	Vec<ll>data;
	BIT(int n_):n(n_),data(n+1){}

	void add(int p,ll v){
		p+=1;
		while (p <= n) {
			data[p]+=v;p+=p&-p;
		}
	}

	ll sum(int r){
		ll ret=0;
		while(r>0){
			ret+=data[r];r-=r&-r;
		}
		return ret;
	}

	ll fold(int l,int r){return sum(r)-sum(l);}
};

ll sol() {
	ll ret=0;
	Vec<ll> event(2*n);
	L(i,0,n)event[lpos[i]]=-i-1;
	L(i,0,n)event[rpos[i]]=i+1;
	BIT t1(2*n),t2(2*n);
	L(p,0,2*n){
		int i=event[p];i=abs(i);i-=1;
		cerr<<i<<endl;
		if(event[p]<0){
			t2.add(p,1);
		}else{
			t2.add(lpos[i],-1);
			ret += t1.fold(lpos[i],p)*2;
			ret += t2.fold(lpos[i],p);
			t1.add(lpos[i],1);
		}
	}
	return ret;
}

long long count_swaps(std::vector<int> s_) {
	s=s_;n=sz(s)/2;
	lpos.assign(n,0);rpos=lpos;
	Vec<queue<int>> id1(n),id2(n);int nid=0;
	L(i,0,2*n){
		int x=abs(s[i])-1;
		if (s[i] < 0) {
			if (id1[x].empty()){
				id2[x].push(i);
			}else{
				lpos[nid]=i;rpos[nid]=id1[x].front();id1[x].pop();++nid;
			}
		}else{
			if(id2[x].empty()){
				id1[x].push(i);
			}else{
				lpos[nid]=id2[x].front();rpos[nid]=i;id2[x].pop();++nid;
			}
		}
	}
	ll ans = 0;
	L(i,0,n)if(lpos[i]>rpos[i]){
		++ans;swap(lpos[i],rpos[i]);
	}

	ans += sol();
	return ans;
}