#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "shoes.h"
struct BIT {
VL a;
BIT(int sz) {
// indexes are [1, sz]
a = VL(sz+1);
}
void add(int i) {
while (i < a.size()) a[i]++, i += i&-i;
}
int get(int i) {
int ret = 0;
while (i) ret += a[i], i -= i&-i;
return ret;
}
};
ll inversions(VI a) {
// a is a permutation
int n = a.size();
BIT bit(n);
ll ret = 0;
rep(i, n) {
ret += i-bit.get(a[i]+1);
bit.add(a[i]+1);
}
return ret;
}
ll distance(VI a, VI b) {
int n = a.size();
VI p;
map<int, VI> mp;
reprl(i, n-1, 0) {
mp[b[i]].pb(i);
}
for (int x : a) {
p.pb(mp[x].back());
mp[x].pop_back();
}
return inversions(p);
}
ll count_swaps(VI s) {
int n = s.size()/2;
VI shoes;
for (int x : s) if (x > 0) shoes.pb(x);
sort(all(shoes));
ll ans = 1e18;
do {
VI wbe;
for (int x : shoes) {
wbe.pb(-x);
wbe.pb(+x);
}
setmin(ans, distance(s, wbe));
} while (next_permutation(all(shoes)));
return ans;
}
