#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
int count_mushrooms(int n) {
if (n <= 227){
int res = 1;
for (int i = 1; i < n; i++){
res += use_machine({0, i}) == 0;
}
return res;
}
vector<int> A = {0}, B;
int k = 73;
int i = 1;
while (i < 3){
if (use_machine({0, i}) == 0) A.push_back(i); else
B.push_back(i);
i++;
}
while (i < 2 * k + 3){
if (A.size() >= 2){
int cnt = use_machine({A[0], i, A[1], i + 1});
if (cnt & 2) B.push_back(i); else
A.push_back(i);
if (cnt & 1) B.push_back(i + 1); else
A.push_back(i + 1);
} else {
int cnt = use_machine({B[0], i, B[1], i + 1});
if (cnt & 2) A.push_back(i); else
B.push_back(i);
if (cnt & 1) A.push_back(i + 1); else
B.push_back(i + 1);
}
i += 2;
}
int res = A.size();
while (i < n){
vector<int> r;
if (A.size() > B.size()){
for (int x : A){
if (i >= n) break;
r.push_back(x);
r.push_back(i);
i++;
}
int cnt = use_machine(r);
if (cnt & 1) B.push_back(r.back()); else
A.push_back(r.back());
res += r.size() / 2 - (cnt + 1) / 2;
} else {
for (int x : B){
if (i >= n) break;
r.push_back(x);
r.push_back(i);
i++;
}
int cnt = use_machine(r);
if (cnt & 1) A.push_back(r.back()); else
B.push_back(r.back());
res += (cnt + 1) / 2;
}
}
return res;
}
