#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
const int NT = 120021;
#define ll long long
int bi[NT], tot = 0;
ll Sum = 0, fib[NT];
int sd[NT], cnt = 0;
void Anna (int N, vector <char> S) {
	int p = -1;
	for (int i=0;i<N;i++) {
		if (S[i] == 'X') {
			p = i;
			break ;
		}
	}
	bool flag = 0;
	if (S[p + 1] == 'Z') S[p + 1] = 'X', flag = 1;
	bi[p] = 1; bi[p + 1] = 0; tot = p + 2;
	for (int l=p+1,r;l<N;l=r+1) {
		r = l; if (S[r] != 'Z') continue ;
		while (S[r] == S[l] && r < N) r ++; r --;
		bi[r] = 1; tot = r + 1;
	}
	fib[0] = 1; fib[1] = 2;
	for (int i=2;i<=64;i++) fib[i] = fib[i - 1] + fib[i - 2];
//	for (int i=0;i<tot;i++) cout << bi[i]; puts ("");
//	ll Tmp = 0; for (int i=62;i>=0;i-=2) Tmp += fib[i];
//	cout << Tmp << endl;
	for (int i=0;i<tot;i+=63) {
		Sum = 0;
		for (int j=0;j<63;j++) {
			int t = j + i; if (t >= tot) break ;
			if (bi[t]) Sum += fib[j];
		}
		for (int t=0;t<44;t++) {
			if (Sum & (1ll << t)) sd[++ cnt] = 1;
			else sd[++ cnt] = 0;
		}
	}
	if (flag) sd[++ cnt] = 1;
	for (int i=1;i<=cnt;i++) Send (sd[i]);
}

#include "Bruno.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int NTT = 220021;
int bit[NTT];
ll fibb[NTT];
bool rem[NTT];

void Bruno(int N, int L, vector<int> A) {
//	cout << L << endl;
//	for (int i=0;i<A.size();i+=45) {
//		for (int j=i;j<i+45&&j<A.size();j++) cout << A[j]; puts ("");
//	}
	fibb[0] = 1; fibb[1] = 2;
	for (int i=2;i<=64;i++) fibb[i] = fibb[i - 1] + fibb[i - 2];
	int p = 0;
	for (int i=0;i<L;i+=44) {
		ll sum = 0;
		for (int j=i+43;j>=i;j--) sum = sum * 2 + A[j];
		for (int j=62;j>=0;j--) {
			if (sum >= fibb[j]) {
				sum -= fibb[j];
				bit[j + p] = 1;
			}
		}
		p += 63;
	}
	bool flag = 0;
	if (A[L - 1]) flag = 1;
	p = min (p, N);
	if (p < N) p = N;
	int t = -1;
	for (int i=0;i<p;i++) {
		if (bit[i]) {
			t = i;
			break ;
		}
		Remove (i); rem[i] = 1;
	}
	if (t == -1) {
		return ;
	}
	rem[t] = 1;
	if (flag) {
		bit[t + 1] = 1;
	}
	for (int j=t+1;j<p;j++) {
		if (bit[j]) {
			for (int k=j-1;!rem[k];k--) Remove (k), rem[k] = 1;
			Remove (j); rem[j] = 1;
		}
	}
	rem[t] = 1; Remove (t);
	for (int i=0;i<p;i++) if (! rem[i]) Remove (i);
}