#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;

#define rep( i, a, b ) for( int i = (a) ; i <= (b) ; i ++ )
#define per( i, a, b ) for( int i = (a) ; i >= (b) ; i -- )

namespace AnnaSpace 
{
	typedef long long LL;
	
	const int MAXN = 1.5e5 + 5;
	
	LL dp[MAXN];
	
	int S[MAXN], mess[MAXN], len;
	int mp[300];

	void Init()
	{
		len = 0;
		mp[int( 'X' )] = 0;
		mp[int( 'Y' )] = 1;
		mp[int( 'Z' )] = 2;
		dp[0] = 1, dp[1] = 2;
		rep( i, 2, 63 ) dp[i] = dp[i - 1] + dp[i - 2];
	}
	
	LL Trans( const int l, const int r )
	{
		if( l > r ) return 0;
		if( l == r ) return mess[r];
		if( mess[r] ) return dp[r - l] + Trans( l, r - 2 );
		return Trans( l, r - 1 );
	}
	
	void Print( LL x )
	{
		for( int k = 43 ; ~ k ; k -- )
			Send( x >> k & 1 );
	}
}

void Anna(int N, std::vector<char> inp)
{
	using namespace AnnaSpace;
	Init();
	rep( i, 0, N - 1 ) S[i + 1] = mp[int( inp[i] )];
	bool flg = false;
	rep( i, 1, N )
	{
		if( flg )
		{
			if( S[i] != 2 ) { mess[++ len] = 0; continue; }
			int j; for( j = i ; j <= N && S[j] == 2 ; j ++ );
			for( int k = i ; k < j - 1 ; k ++ ) mess[++ len] = 0;
			mess[++ len] = 1, i = j - 1;
		}
		else 
		{
			if( S[i] == 0 ) 
				flg = true, mess[++ len] = 1, mess[++ len] = 0;
			else mess[++ len] = 0;
		}
	}
	for( int l = 1, r ; l <= len ; l += 63 )
	{
		r = min( len, l + 62 );
		Print( Trans( l, r ) );
	}
}

#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;

#define rep( i, a, b ) for( int i = (a) ; i <= (b) ; i ++ )
#define per( i, a, b ) for( int i = (a) ; i >= (b) ; i -- )

namespace BrunoSpace 
{
	typedef long long LL;
	
	const int MAXN = 1.5e5 + 5;

	LL dp[MAXN];
	
	int S[MAXN], tot;
	bool moved[MAXN];
	
	void Init()
	{
		dp[0] = 1, dp[1] = 2;
		rep( i, 2, 63 ) dp[i] = dp[i - 1] + dp[i - 2];
	}
	
	void Erase( const int x )
	{
		if( moved[x] ) return ;
		moved[x] = true;
		Remove( x - 1 );
//		fprintf( stderr, "Remove( %d )\n", x );
	}
	
	void Trans( const LL x, const int len )
	{
		if( ! len ) return ;
		if( len == 1 ) S[++ tot] = x;
		else
		{
			if( x < dp[len - 1] )
				Trans( x, len - 1 ), S[++ tot] = 0;
			else
				Trans( x - dp[len - 1], len - 2 ), S[++ tot] = 0, S[++ tot] = 1;
		}
	}
}  // namespace

void Bruno(int N, int L, std::vector<int> A) 
{
	using namespace BrunoSpace;
	Init();
	int tims = L / 44;
	for( int i = 0 ; i < tims ; i ++ )
	{
		LL id = 0;
		for( int j = 0 ; j < 44 ; j ++ )
			id = ( id << 1 ) | A[i * 44 + j];
		Trans( id, 63 );
	}
	int lst = -1, firX = -1;
	bool flg = false;
	rep( i, 1, tot )
	{
		flg = false;
		if( ! S[i] ) continue;
		if( ~ lst )
		{
			per( j, i - 1, max( firX + 2, lst + 1 ) )
				Erase( j - 1 );
			Erase( i - 1 );
		}
		else flg = true, firX = i;
		lst = i, i += flg;
	}
	rep( i, 1, N ) Erase( i );
}