#include "Anna.h"
#include <vector>
using namespace std;

namespace
{
#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

auto chmax = [](auto& x, auto y) { if (x < y) x = y; };
auto chmin = [](auto& x, auto y) { if (y < x) x = y; };

using ull = unsigned long long;
using ll = long long;

const int B = 63, lgC = 44;
ull f[B + 1];
}

void Anna(int n, vector<char> S)
{
	int i = 0;
	while (i < n && S[i] != 'X')
		i++;
	if (i == n)
		return;
	
	vector<bool> s(n + 1);
	s[i] = 1;
	
	for (int k = i; k < n; k++)
	{
		while (k + 1 < n && S[k + 1] == 'Z')
			k++;
		s[k + 1] = (S[k] == 'Z');
	}
	f[0] = 1, f[1] = 2;
	for (int i = 2; i <= B; i++)
		f[i] = f[i - 1] + f[i - 2];
	
	for (int i = 0; i < ssz(s); )
	{
		ull cid = 0;
		for (int j = 0; j < B; j++, i++)
		{
			int b = (i < ssz(s) ? s[i] : 0);
			if (b)
				cid += f[B - j - 1];
		}
		for (int j = 0; j < lgC; j++)
		{
			Send(cid % 2);
			cid >>= 1;
		}
	}
}

#include "Bruno.h"
#include <vector>
// #include <iostream>
using namespace std;

namespace
{
#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

auto chmax = [](auto& x, auto y) { if (x < y) x = y; };
auto chmin = [](auto& x, auto y) { if (y < x) x = y; };

using ull = unsigned long long;
using ll = long long;

const int B = 63, lgC = 44;
ull f[B + 1];
}  // namespace

void Bruno(int n, int l, vector<int> a)
{
	if (a.empty())
	{
		for (int i = 0; i < n; i++)
			Remove(i);
		return;
	}
	
	f[0] = 1, f[1] = 2;
	for (int i = 2; i <= B; i++)
		f[i] = f[i - 1] + f[i - 2];
	
	vector<bool> s;
	
	for (int i = 0, k = 0; i < l; )
	{
		ull sv = 0, cb = 1;
		for (int j = 0; j < lgC; j++, i++)
			sv += a[i] * cb, cb <<= 1;
		for (int j = 0; j < B; j++, k++)
		{
			s.push_back(sv >= f[B - j - 1]);
			if (sv >= f[B - j - 1])
				sv -= f[B - j - 1];
		}
	}
	// for (int i = 0; i < n; i++)
	// 	cerr << s[i];
	// cerr << "\n";
	
	int i = 0;
	while (i < n && s[i] == 0)
		Remove(i++);
	int k = i;
	for (int j = i + 1; j < n; j++)
		if (s[j + 1] == 1)
		{
			for (int t = j - 1; t > k; t--)
				Remove(t);
			Remove(j);
			k = j;
		}
	k++;
	while (k < n)
		Remove(k++);
	Remove(i);
}