#include "Anna.h"
#include<bits/stdc++.h>
using namespace std;
namespace ANNA
{
    int n,p;
    vector<char>s;
    int b[100110];
    unsigned long long a[64],sxc;
    inline unsigned long long get_rk(int l,int r)
    {
        if(l>r)return 0;
        if(l==r)return b[r];
        if(b[r])return a[r-l]+get_rk(l,r-2);
        return get_rk(l,r-1);
    }
    inline void solve()
    {
        for(int i=1,op=0,j;i<=n;++i)
        {
            if(op)
            {
                if(s[i-1]!='Z'){b[++p]=0;continue;}
                for(j=i;j<=n&&s[j-1]=='Z';++j);
                for(int k=i;k<j-1;++k)b[++p]=0;
                b[++p]=1,i=j-1;
            }
            else 
            {
                if(s[i-1]=='X')op=1,b[++p]=1,b[++p]=0;
                else b[++p]=0;
            }
        }
        a[0]=1,a[1]=2;
        for(int i=2;i<=63;++i)a[i]=a[i-1]+a[i-2];
        for(int i=1;i<=p;i+=63) 
        {
            sxc=get_rk(i,min(p,i+62));
            for(int j=0;j<44;++j)Send((sxc>>j)&1);
        }
        return ;
    }
}
void Anna(int n,vector<char>s) 
{
    ANNA::n=n,ANNA::s=s;
    ANNA::solve();
    return ;
}

#include "Bruno.h"
#include<bits/stdc++.h>
using namespace std;
namespace BRUNO
{
    int n,p;
    vector<int>sbs;
    int b[100110];
    unsigned long long a[64],sxc;
    inline void solve() 
    {
        a[0]=1,a[1]=2;
        for(int i=2;i<=63;++i)a[i]=a[i-1]+a[i-2];
        for(int i=0,l,r;i<(int)sbs.size();i+=44) 
        {
            sxc=0;
            for(int j=min(i+43,(int)sbs.size()-1);j>=i;--j)sxc=sxc<<1|sbs[j];
            l=i/44*63,r=l+62;
            for(int j=l;j<=r;++j)if(sxc>=a[r-j])b[j]=1,sxc-=a[r-j];
        }
        p=0;
        while(p<n&&!b[p])Remove(p++);
        if(p==n)return ;
        for(int i=p+1,lp=p;i<n;++i) 
        {
            while(i<n&&!b[i+1])++i;
            for(int j=i-1;j>=lp+1;--j)Remove(j);
            if(i<n)Remove(lp=i++);
        }
        Remove(p);
        return ;
    }
}
void Bruno(int n,int l,vector<int>SXC) 
{
    BRUNO::n=n,BRUNO::sbs=SXC;
    BRUNO::solve();
    return ;
}