#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
lo cev;
map<int,int> mpp;
string s;
long long count_swaps(std::vector<int> v) {
for(int i=0;i<(int)v.size();i++){
if(mpp[-v[i]]){
mpp[-v[i]]--;
if(v[i]>0){
int ind=-1;
for(int j=0;j<(int)v.size();j++){
if(v[j]==-v[i] && v[j+1]!=v[i]){ind=j;break;}
}
if(ind!=-1){
for(int j=i;j>ind+1;j--){
cev++;
swap(v[j],v[j-1]);
}
}
}
else{
int ind=-1;
for(int j=0;j<(int)v.size();j++){
if(v[j]==-v[i] && (j==0 || v[j-1]!=v[i])){ind=j;break;}
}
if(ind!=-1){
for(int j=i;j>ind;j--){
cev++;
swap(v[j],v[j-1]);
}
}
}
}
else{
mpp[v[i]]++;
}
}
return cev;
}
