#include "shoes.h"
//~ #include "grader.cpp"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define order_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
long long count_swaps(std::vector<int> a) {
int n = a.size()/2;
int la[n*2]{};
stack<int> pos[n+1], neg[n+1];
for(int i = 0; i < n*2; i++){
int x = a[i];
if(x < 0){
if(!pos[-a[i]].empty()){
la[pos[-a[i]].top()] = i;
pos[-a[i]].pop();
}else{
neg[-a[i]].push(i);
}
}else{
if(!neg[a[i]].empty()){
la[neg[a[i]].top()] = i;
neg[a[i]].pop();
}else{
pos[a[i]].push(i);
}
}
}
order_set st;
int ans = 0, us[n*2]{};
for(int i = 0; i < n*2; i++){
if(us[i]){
st.erase(i);
continue;
}
int r = st.order_of_key(la[i]);
ans += la[i]-i-1-r;
st.insert(la[i]);
us[la[i]]++;
}
int us2[n*2]{};
for(int i = 0; i < n*2; i++){
if(us2[i])continue;
us2[la[i]]++;
ans += (a[i] > 0);
}
return ans;
}
