#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif
namespace {
const int maxn = 1e5+5;
const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;
int variable_example = 0;
}
void Anna(int n, std::vector<char> S) {
vector<int> ret(n);
bool zed = 0;
for (int i = n-1; i>=0; --i) {
if (S[i] == 'Z' && !zed) {
ret[i] = 1; zed = 1;
}
else if (S[i] == 'X' && zed && (i==0 || S[i-1] != 'X')) {
ret[i] = 1;
}
}
REP(i,n) {
Send(ret[i]);
}
}
#include<bits/stdc++.h>
#include "Bruno.h"
using namespace std;
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
//const int N = 1e5 + 5;
//const int oo = 1e18 + 7, mod = 1e9 + 7;
void Bruno(int N, int L, vector<int> a){
//cout << N << " " << L << "\n";
vector<int> not_rev;
int pos = -1;
for(int i = N - 1; i >= 0; i--){
if(a[i]){
pos = i;
break;
}
}
if(pos == -1){
for(int i = 0; i < N; i++) Remove(i);
return;
}
int lst = pos;
for(int i = pos - 1; i >= 0; i--){
if(!i || a[i]){
for(int j = i + 1; j < lst; j++) Remove(j);
Remove(i);
lst = i;
}
//Remove(i);
}
for(int i = pos; i < N; i++) Remove(i);
}
/*
void process(){
}
signed main(){
ios_base::sync_with_stdio(0);
process();
}*/
