#ifndef hwe
#include "squares.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T1, class T2> T1 random(T1 l, T2 r) {
return uniform_int_distribution<T1>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
bitset<N> vis;
void backtrack(int num, int len, vector<int> &sequence) {
for (int i : {0, 1}) {
int nxt = OFF(num, len - 1) << 1 | i;
if (!vis[nxt]) {
vis.set(nxt);
backtrack(nxt, len, sequence);
sequence.emplace_back(i);
}
}
}
vector<int> deBrujin(int k) {
vector<int> sequence;
backtrack(0, k, sequence);
for (int i = 1; i < k; ++i) sequence.emplace_back(0);
return sequence;
}
vector<int> paint(int n) {
vector<int> labels(n + 1, -1);
for (int k = 1; ; ++k) {
int expected_len = k - 1 + MASK(k);
if (expected_len < n) continue;
vector<int> sequence = deBrujin(k);
assert(sequence.size() == expected_len);
for (int j = 0; j < n; ++j) labels[j] = sequence[j];
labels.back() = k;
break;
}
return labels;
}
int find_location(int n, vector<int> c) {
int k = c.size();
if (c.back() == -1) {
while (c.back() == -1) c.pop_back();
return n - c.size() + 1;
}
vector<int> sequence = deBrujin(k);
for (int x = 0; x + k - 1 < n; ++x) {
bool check = true;
for (int i = 0; i < k; ++i) if (sequence[x + i] != c[i]) {
check = false;
break;
}
if (check) return x;
}
return -1;
}
#ifdef hwe
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
paint(0);
cerr << '\n'; return 0;
}
#endif
