#include "shoes.h"
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
using namespace std;
long long count_swaps(std::vector<int> s) {
int n=s.size(),ans=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++)
if(s[i]==-s[j]){
for(int k=j;k>i+1;k--)
swap(s[k],s[k-1]),ans++;
break;
}
if(s[i]>s[i+1])
swap(s[i],s[i+1]),ans++;
i++;
}
return ans;
}
/*
int main() {
freopen("file.in","r",stdin);
int n;
assert(1 == scanf("%d", &n));
vector<int> S(2 * n);
for (int i = 0; i < 2 * n; i++)
assert(1 == scanf("%d", &S[i]));
long long result = count_swaps(S);
printf("%lld\n", result);
return 0;
}*/
