#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "shoes.h"
ll count_swaps(vi s) {
int n = s.size()/2;
if (n == 1) return s[0] > s[1];
ll cnt = 0;
stack<int> s1, s2;
f0r(i, 2*n) {
if (s[i] < 0 && (i & 1)) {
if (s2.size()) {
int x = s2.top();
cnt += i - x;
s2.pop();
} else s1.push(i);
} else if (s[i] > 0 && !(i & 1)) {
if (s1.size()) {
int x = s1.top();
cnt += i - x;
s1.pop();
} else s2.push(i);
}
}
return cnt;
}
