#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
namespace{
    const int maxn=1e5+5;
    const int B=183;
#define INT __uint128_t
    int a[maxn];
    INT f[maxn];
    const INT one=1;
}
char s[maxn];
void Anna(int n,vector<char>s){
    f[1]=2,f[0]=1;
    for(int i=2;i<B;i++)f[i]=f[i-1]+f[i-2];
    /* s.resize(maxn); */
    int lst=n;
    for(int i=n-1;i>=0;i--){
        if(s[i]=='Z'){
            lst=i;break;
        }
    }
    for(int i=0;i<20;i++)Send(lst>>i&1);
    /* cout<<"ANNA: "; */
    for(int i=0;i<n;i++){
        if(s[i]=='X'&&(i==0||s[i-1]!='X'))a[i]=1;
        /* cout<<a[i]<<" "; */
    }
    /* puts(""); */
    for(int i=0;i<n;i+=B){
        INT res=0;
        for(int j=0;j<B;j++){
            res+=a[i+j]*f[j];
        }
        /* cout<<"ANNA: "<<(long long )res<<endl; */
        for(int i=0;i<128;i++)Send((res>>i)&one);
        /* puts(""); */
    }
}

#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
namespace{
    const int maxn=1e5+5;
    const int B=183;
#define INT __uint128_t
    INT f[maxn];
    INT bs[maxn];
    int g[maxn];
    const INT one=1;
}

void Bruno(int N,int L,std::vector<int>a){
    int Z=0;
    bs[0]=1;f[1]=2,f[0]=1;
    for(int i=1;i<128;i++)bs[i]=bs[i-1]*2;
    for(int i=2;i<B;i++)f[i]=f[i-1]+f[i-2];
    /* cout<<"Bruno get: "; */
    /* for(int i=0;i<L;i++)cout<<a[i];cout<<endl; */
    for(int i=0;i<20;i++)Z|=(1<<i)*a[i];
    /* cout<<"Z "<<Z<<endl; */
    for(int i=0;i+20<L;i+=128){
        INT res=0;
        for(int j=0;j<128;j++){
            res+=bs[j]*a[i+j+20];
        }
        /* cout<<"getres "<<(long long)res<<endl; */
        for(int j=B-1;j>=0;j--){
            if(res>=f[j])res-=f[j],g[i/128*B+j]=1;
        }
    }
    /* for(int i=0;i<N;i++)cout<<g[i]<<" "; */
    /* puts(""); */
    int cur=N-1;
    while(cur>Z)Remove(cur),--cur;
    if(cur==Z)--cur;
    while(cur>=0){
        int ps=cur;
        while(!g[ps]&&ps>0)--ps;
        /* cout<<"round "<<ps<<" "<<cur<<endl; */
        for(int j=ps+1;j<=cur;j++)Remove(j);
        Remove(ps);
        cur=ps-1;
    }
    if(Z<N)Remove(Z);
}