#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"
const int M = 100;
int count_mushrooms(int n) {
int cntA = 1, cntB = 0;
vi A{0}, B;
int j = 1;
while (j < n && max(cntA, cntB) <= M) {
int c = use_machine({0, j});
if (c == 1) {
cntB++;
B.pb(j);
} else {
cntA++;
A.pb(j);
}
++j;
}
if (j >= n) return cntA;
int cnt = cntA;
for (; j < n; j += M) {
vi v;
int r = min(j+M, n);
if (cntA > cntB) {
f0r(i, r-j) {
v.pb(A[i]);
v.pb(j+i);
}
v.pb(A[r-j]);
cnt += r-j - use_machine(v)/2;
} else {
f0r(i, r-j) {
v.pb(B[i]);
v.pb(j+i);
}
v.pb(B[r-j]);
cnt += use_machine(v)/2;
}
}
return cnt;
//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;
}
