#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
#define endl "\n"
#define int long long
const int INF = 1e9+7;
const int MOD = 1e9+7;
int64_t count_swaps(vector<int32_t> a){
int n = a.size();
if(n == 1){
if(a[1] < a[0]) return 1;
else return 0;
} else if(n <= 8){
unordered_map<int, int> distMap;
for(int i = 0; i < n; i++){
if(distMap[abs(a[i])] == 0){
distMap[abs(a[i])] += i;
} else {
distMap[abs(a[i])] = abs(distMap[abs(a[i])] - i);
}
}
vector<pair<int, int>> dist;
for(auto &i : distMap){
dist.push_back({i.first, i.second});
}
sort(dist.begin(), dist.end(), [&](auto left, auto right){
return left.second < right.second;
});
int sol = 0, cnt = 0;
for(auto &i : dist){
sol += (i.second-cnt);
cnt++;
}
return sol;
} else {
vector<int> pos, neg;
for(int i = 0; i < n; i++){
if(a[i] > 0 && i%2==0) pos.push_back(i);
else if(a[i] < 0 && i%2!=0) neg.push_back(i);
}
int sol = 0, idx = 0;
if(pos.size() < neg.size()){
for(auto &i : pos){
sol += abs(i-neg[idx]);
idx++;
}
} else {
for(auto &i : neg){
sol += abs(i-pos[idx]);
idx++;
}
}
return sol;
}
}
