#include "shoes.h"
#include <bits/stdc++.h>
#define uwu return
using namespace std;
const int SIZE = 1e5 + 5;
long long count_inverse(vector <int> vec){
long long cnt = 0;
for(int i = 0; i < (int)vec.size(); i++){
for(int j = 0; j < i; j++){
cnt += vec[j] > vec[i];
}
}
uwu cnt;
}
deque <int> r_pos[SIZE];
long long count_swaps(vector<int> s) {
int N = s.size() / 2;
vector <int> pos(2 * N);
int ptr = 0;
for (int i = 0; i < 2 * N; i++){
if(s[i] > 0)
r_pos[s[i]].push_back(i);
}
for (int i = 0; i < 2 * N; i++){
if(s[i] < 0){
pos[i] = 2 * ptr;
pos[r_pos[-s[i]].front()] = 2 * ptr + 1;
ptr++;
r_pos[-s[i]].pop_front();
}
}
uwu count_inverse(pos);
}
