#include "brperm.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
int revbits(int x,int k) {
int ans = 0;
for (int j = 0;j<k;j++) {
if (x&(1LL<<(k-j-1))) ans+=(1LL<<j);
}
return ans;
}
string t;
vi prefa,prefb;
void init(int n, const char s[]) {
while (big(t) != n) t+='0';
prefa.assign(n,0),prefb.assign(n,0);
for (int j = 0;j<n;j++){
if (j) prefa[j] = prefa[j-1],prefb[j] = prefb[j-1];
t[j] = s[j];
if (t[j] == 'a') prefa[j]++;
else prefb[j]++;
}
}
int query(int p, int k) {
if (p+(1LL<<k)-1 >= big(t)) return 0;
int as = prefa[p+(1LL<<k)-1]-(p?(prefa[p-1]):0ll);
int bs = prefb[p+(1LL<<k)-1]-(p?(prefb[p-1]):0ll);
if (min(as,bs) > 1000) return 0;
for (int j = 0;j<(1LL<<k);j++) {
int togo = revbits(j,k);
if (t[p+j] != t[p+togo]) return 0;
}
return 1;
}
