#include <iostream>
using namespace std;
class QUEUE {
private:
int* q;
int N;
int head;
int tail;
public:
QUEUE(int maxN) {
q = new int[maxN + 1];
N = maxN + 1; head = N; tail = 0;
}
int empty() const {
return head % N == tail;
}
void put(int item) {
q[tail++] = item; tail = tail % N;
}
int get() {
head = head % N; return q[head++];
}
};
int main() {
int n = 5;
QUEUE q(n);
for (int i = 0; i < n + 1; ++i){
q.put(1);
}
cout << q.empty() << "\n";
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKY2xhc3MgUVVFVUUgewpwcml2YXRlOgogICAgaW50KiBxOwogICAgaW50IE47CiAgICBpbnQgaGVhZDsKICAgIGludCB0YWlsOwpwdWJsaWM6CiAgICBRVUVVRShpbnQgbWF4TikgewogICAgICAgIHEgPSBuZXcgaW50W21heE4gKyAxXTsKICAgICAgICBOID0gbWF4TiArIDE7IGhlYWQgPSBOOyB0YWlsID0gMDsKICAgIH0KICAgIGludCBlbXB0eSgpIGNvbnN0IHsKICAgICAgICByZXR1cm4gaGVhZCAlIE4gPT0gdGFpbDsKICAgIH0KICAgIHZvaWQgcHV0KGludCBpdGVtKSB7CiAgICAgICAgcVt0YWlsKytdID0gaXRlbTsgdGFpbCA9IHRhaWwgJSBOOwogICAgfQogICAgaW50IGdldCgpIHsKICAgICAgICBoZWFkID0gaGVhZCAlIE47IHJldHVybiBxW2hlYWQrK107CiAgICB9Cn07CgppbnQgbWFpbigpIHsKCWludCBuID0gNTsKCVFVRVVFIHEobik7Cglmb3IgKGludCBpID0gMDsgaSA8IG4gKyAxOyArK2kpewoJCXEucHV0KDEpOwoJfQoJY291dCA8PCBxLmVtcHR5KCkgPDwgIlxuIjsKCXJldHVybiAwOwp9