#include "Anna.h"
//#include "Bruno.h"
#include<bits/stdc++.h>
#define fi first
#define se second
#define FOR(i, k, n) for(int i = k; i <= n; i++)
#define FOR1(i, k, n) for(int i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "ALONE.inp"
#define output "ALONE.out"
#define rf freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
ll f[70];
void Anna(int n, std::vector<char> s) {
int vt = -1;
FOR(i, 0, n - 1)
if(s[i] == 'X')
{
vt = i;
break;
}
if(vt == -1)
return;
f[0] = f[1] = 1;
FOR(i, 2, 65)
f[i] = f[i - 1] + f[i - 2];
vi vv;
FOR(i, 0, vt - 1)
vv.pb(0);
vv.pb(1);
if(vt + 1 < n)
vv.pb(0);
FOR(i, vt + 2, n - 1)
if(s[i] == 'Z' && s[i - 1] != 'Z')
vv.pb(1);
else
vv.pb(0);
int l = 0, r = 63;
while(l < n)
{
r = min(r, n - 1);
ll res = 0;
FOR(i, l, r)
if(vv[i])
res += f[i - l];
FOR(i, 0, 44)
Send((res >> i) & 1);
l += 64;
r += 64;
}
}
//#include "Anna.h"
#include "Bruno.h"
#include<bits/stdc++.h>
#define fi first
#define se second
#define FOR(i, k, n) for(int i = k; i <= n; i++)
#define FOR1(i, k, n) for(int i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "ALONE.inp"
#define output "ALONE.out"
#define rf freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
ll f[70];
void Bruno(int n, int L, std::vector<int> s) {
if(s.empty())
{
FOR(i, 0, n - 1)
Remove(i);
return;
}
f[0] = f[1] = 1;
FOR(i, 2, 65)
f[i] = f[i - 1] + f[i - 2];
int l = 0, r = 63, d = 0;
vi s1, tmp;
while(l < n)
{
r = min(r, n - 1);
ll res = 0;
FOR(i, 0, 44)
{
if(s[d + i] - '0' == 1)
res += (1ll << i);
}
tmp.clear();
FOR1(i, r - l, 0)
if(res >= f[i])
{
res -= f[i];
tmp.pb(1);
}
else
tmp.pb(0);
reverse(tmp.begin(), tmp.end());
for(auto x : tmp)
s1.pb(x);
l += 64;
r += 64;
d += 45;
}
int vt = n;
FOR(i, 0, n - 1)
{
if(s1[i] == 1)
{
vt = i;
break;
}
Remove(i);
}
if(vt == n)
return;
vector<int> vv;
vv.pb(vt);
FOR(i, vt + 1, n - 1)
{
if(s1[i] == 1)
{
while(vv.size() > 1)
{
Remove(vv.back());
vv.pop_back();
}
Remove(i);
}
else
{
vv.pb(i);
}
}
for(auto x : vv)
Remove(x);
return;
}
