#include "shoes.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
int n = s.size() / 2;
vector<int> si;
for(int i = 0; i < 2 * n; i++)
{
if(s[i] >= 0) si.push_back(s[i]);
}
sort(si.begin(), si.end());
int ans = 1e9;
do
{
int cur = 0;
vector<int> v;
for(int i = 0; i < n; i++)
{
v.push_back(-si[i]);
v.push_back(si[i]);
}
for(int i = 0; i < 2 * n; i++)
{
int fi = 0;
for(int j = i; j < 2 * n; j++)
{
if(v[i] == s[j])
{
fi = j;
break;
}
}
for(int j = fi; j > i; j--)
{
swap(v[j], v[j - 1]);
cur++;
}
}
ans = min(ans, cur);
} while (next_permutation(si.begin(), si.end()));
return ans;
}
