#include "shoes.h" long long count_swaps(std::vector<int> s) { int n = s.size(); if (n == 2){ if (s[0] == -1) return 0; } else{ long long count = 0; for (int i = 0; i < n; i++){ if (i % 2 == 0 && s[i] != -1) count++; else if (i % 2 == 1 && s[i] != 1) count++; } return count; } return 1; }