#include "Anna.h"
#include <vector>
using namespace std;
void Anna(int N,vector<char> S){
	using ll=long long;
	vector<int> a([](int n){
		while(n%63)
			++n;
		return n;
	}(N));
	ll fib[63]={1,2};
	for(int i=2;i<63;++i)
		fib[i]=fib[i-1]+fib[i-2];
	bool f=false;
	for(int i=0;i<N;++i){
		if(!f){
			if(S[i]=='X'){
				f=true;
				a[i]=1;
				++i;
			}
		}else if(S[i]=='Z'){
			if(S[i-1]=='Z')
				a[i-1]=0;
			a[i]=1;
		}
	}
	for(int i=0;i<int(a.size());i+=63){
		ll s=0;
		for(int j=0;j<63;++j)
			if(a[i+j])
				s+=fib[62-j];
		for(int j=0;j<44;++j)
			Send((s>>j)&1);
	}
}

#include "Bruno.h"
#include <vector>
using namespace std;
void Bruno(int N,int L,vector<int> A){
	using ll=long long;
	vector<int> a([](int n){
		while(n%63)
			++n;
		return n;
	}(N));
	ll fib[63]={1,2};
	for(int i=2;i<63;++i)
		fib[i]=fib[i-1]+fib[i-2];
	for(int i=0;i*44<L;++i){
		ll s=0;
		for(int j=0;j<44;++j)
			if(A[i*44+j])
				s|=(1LL<<j);
		for(int j=0;j<63;++j)
			if(s>=fib[62-j]){
				s-=fib[62-j];
				a[i*63+j]=1;
			}
	}
	vector<int> stk;
	for(int i=0;i<N;++i)
		if(a[i]){
			if(!stk.size()){
				stk.push_back(i);
				if(i+1<N)
					Remove(++i);
			}else{
				while(int(stk.size())>1){
					Remove(stk.back());
					stk.pop_back();
				}
				Remove(i);
			}
		}else{
			if(stk.size())
				stk.push_back(i);
			else
				Remove(i);
		}
	while(stk.size()){
		Remove(stk.back());
		stk.pop_back();
	}
}