#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
int count_mushrooms(int N) {
n = N;
if (n <= 451) {
int ans = 1;
for (int i = 2;i < n;i += 2) {
int v = use_machine({ i - 1, 0, i });
if (v == 1) ans++;
else if (v == 0) ans += 2;
}
if ((n - 1) & 1) {
if (!use_machine({ 0, n - 1 })) ans++;
}
return ans;
}
int sq = 141;
vector<int> A, B;
A.push_back(0);
int p;
for (p = 2;p < n && (int)A.size() < sq && (int)B.size() < sq;p += 2) {
if (A.size() < 2 && B.size() < 2) {
int v = use_machine({ p - 1, 0, p });
if (v == 0) {
A.push_back(p);
A.push_back(p - 1);
}
else if (v == 2) {
B.push_back(p);
B.push_back(p - 1);
}
else {
if (use_machine({ 0, p })) B.push_back(p), A.push_back(p - 1);
else B.push_back(p - 1), A.push_back(p);
}
}
else if (A.size() >= 2) {
int v = use_machine({ A[0], p - 1, A[1], p });
if (v & 1) B.push_back(p);
else A.push_back(p);
if (v & 2) B.push_back(p - 1);
else A.push_back(p - 1);
}
else {
int v = use_machine({ B[0], p - 1, B[1], p });
if (!(v & 1)) B.push_back(p);
else A.push_back(p);
if (!(v & 2)) B.push_back(p - 1);
else A.push_back(p - 1);
}
}
p--;
// count A from p -> n - 1
int ans = A.size();
if (A.size() > B.size()) {
int sz = A.size();
for (int i = p, j;i < n;i = j) {
vector<int> Q;
for (j = i;j < min(n, i + sz - 1);j++) {
Q.push_back(j);
Q.push_back(A[j - i]);
}
int v = use_machine(Q);
int s = Q.size();
ans += (s - v) / 2;
}
}
else {
int sz = B.size();
for (int i = p, j;i < n;i = j) {
vector<int> Q;
for (j = i;j < min(n, i + sz - 1);j++) {
Q.push_back(j);
Q.push_back(B[j - i]);
}
int v = use_machine(Q);
ans += (v + 1) / 2;
}
}
return ans;
}
