#include "shoes.h"
#include <bits/stdtr1c++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
int n = s.size() / 2;
vector<int> sizes;
for (int c : s) {
if (c > 0) sizes.push_back(c);
}
sort(sizes.begin(), sizes.end());
long long ans = LLONG_MAX;
do {
long long count = 0;
auto t = s;
for (int i = 0; i < 2 * n; i ++) {
int size = sizes[i / 2];
if (i % 2 == 0) size *= -1;
int index;
for (int j = i; j < 2 * n; j ++) {
if (t[j] == size) index = j;
}
for (int j = index; j > i; j --) {
swap(t[j], t[j - 1]);
count ++;
}
}
ans = min(ans, count);
} while (next_permutation(sizes.begin(), sizes.end()));
return ans;
}
