#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include "shoes.h"
using namespace std;
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
/********* DEBUG *********/
template <typename T>
void outvec(const vector<T>& Z){
for (const T& x : Z)
cout << x << ' ';
cout << "\n";
}
void printVariable(const any& var) {
if (!var.has_value()) {
cout << "null";
return;
}
if (var.type() == typeid(int)) {
cout << any_cast<int>(var);
} else if (var.type() == typeid(double)) {
cout << any_cast<double>(var);
} else if (var.type() == typeid(float)) {
cout << any_cast<float>(var);
} else if (var.type() == typeid(char)) {
cout << any_cast<char>(var);
} else if (var.type() == typeid(bool)) {
cout << (any_cast<bool>(var) ? "true" : "false");
} else if (var.type() == typeid(string)) {
cout << any_cast<string>(var);
} else if (var.type() == typeid(const char*)) {
cout << any_cast<const char*>(var);
} else if (var.type() == typeid(long long)) {
cout << any_cast<long long>(var);
} else {
cout << "[unknown type]";
}
}
template<typename... Args>
void outval(Args... args) {
vector<any> variables = {args...};
for (size_t i = 0; i < variables.size(); ++i) {
printVariable(variables[i]);
if (i != variables.size() - 1) {
cout << " ";
}
}
cout << "\n";
}
#define nl "\n"
#define sp << " " <<
/********* DEBUG *********/
const ll MOD = 1000000007;
const ll inf = 1e18;
const ll mxN = 100005;
void solve(){
}
long long count_swaps(vector<int> s) {
vector<vector<ll>> l(mxN), r(mxN);
vector<ll> ptrs(mxN, 0);
for (int i = 0; i < s.size(); i++){
if (s[i] < 0)
l[abs(s[i])].push_back(i);
else
r[s[i]].push_back(i);
}
vector<bool> dn(mxN, false);
ll ans = 0;
for (int i = 0; i < s.size(); i++){
if (dn[i])
continue;
if (s[i] < 0){
s[i] *= -1;
ll idx = r[s[i]][ptrs[s[i]]];
dn[idx] = true;
if (idx != i+1)
ans += idx-i;
ptrs[s[i]]++;
}
else{
ll idx = l[s[i]][ptrs[s[i]]];
dn[idx] = true;
ans += idx-i;
ptrs[s[i]]++;
}
}
return ans;
}
