#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 "mushrooms.h"
int count_mushrooms(int n) {
int cnt = 1;
V<pi> ps;
for (int i = 1; i < n; i+=2) {
if (i == n-1) {
cnt += !use_machine({0, i});
} else {
int x = use_machine({0, i, i+1});
if (x == 0) cnt += 2;
else if (x == 2) cnt += 1;
else {
ps.pb({i, i+1});
}
}
}
if (ps.size()) {
auto [a, b] = ps.back();
int c = use_machine({a, b});
cnt += c;
ps.pop_back();
vi v = {0, a, b};
for (auto &[x, y]: ps) {
v.pb(x);
v.pb(y);
}
cnt += (use_machine(v)-1)/2;
}
return cnt;
}
