/*************************************
* author: marvinthang *
* created: 21.03.2023 23:00:23 *
*************************************/
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
namespace {
}
void Anna(int n, vector <char> s) {
bool first_x = false;
for (char c: s) {
if (!first_x && c == 'X') {
first_x = true;
Send(1);
} else if (first_x && c == 'Z') Send(1);
else Send(0);
}
}
/*************************************
* author: marvinthang *
* created: 21.03.2023 23:03:23 *
*************************************/
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
namespace {
}
void Bruno(int N, int L, std::vector<int> A) {
int first_x = -1;
int last = -1;
REP(i, N) if (A[i]) {
if (first_x == -1) {
first_x = i;
REP(j, i) Remove(j);
} else {
FORD(j, i, last + 1) Remove(j);
Remove(i);
}
last = i;
}
FOR(j, last + 1, N) Remove(j);
if (first_x != -1) Remove(first_x);
}
