// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define conts continue
#define sz(a) a.size()
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &x, T y){
x = min(x,y);
}
template<typename T>
void amax(T &x, T y){
x = max(x,y);
}
#define debug(x) cout << #x << " = "; cout << x; cout << endl
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;
#include "prison.h"
int pos_bit(int x, int b, int p){
rep(i,p){
x /= b;
}
return x%b;
}
std::vector<std::vector<int>> devise_strategy(int n) {
int base = 4;
int LOG = 0;
while(pow(base,LOG+1) <= n) LOG++;
LOG++;
vector<vector<int>> a(LOG*(base+1)-2,vector<int>(n+1));
int curr_bit = LOG;
rep(i,sz(a)){
if(i%(base+1) == 0){
curr_bit--;
}
if(i%(base+1) == 0){
a[i][0] = 0;
rep1(j,n){
int b = pos_bit(j,base,curr_bit);
if(curr_bit > 0){
a[i][j] = i+1+b;
}
else{
if(b == 0){
a[i][j] = -1;
}
else if(b == base-1){
a[i][j] = -2;
}
else{
a[i][j] = i+b;
}
}
}
}
else{
a[i][0] = 1;
int b1 = (i%(base+1))-1;
if(curr_bit == 0){
b1++;
}
int nxt = (i/(base+1)+1)*(base+1);
rep1(j,n){
int b2 = pos_bit(j,base,curr_bit);
if(b1 < b2){
a[i][j] = -1;
}
else if(b2 < b1){
a[i][j] = -2;
}
else{
a[i][j] = min((int)sz(a)-1,nxt);
}
}
}
}
// rep(i,sz(a)){
// rep(j,n+1){
// cout << a[i][j] << " ";
// }
// cout << endl;
// }
return a;
}
