#include "xylophone.h"
#include <bits/stdc++.h>
const int NN = 5e3 + 7;
int b[NN];
int get( int x , int y , int x1 , int y1 )
{
if( x1 > y1 ){
if( y == x1 - y1 )return x1 - x;
if( x == y )return x1 - x;
return x1 + x;
}else{
if( y == x + y1 - x1 )return x1 - x;
if( y == y1 - x1 )return x1 + x;
return x1 + x;
}
}
void solve(int n)
{
int i = 1 , j = n;
int l = i , r = n;
while( l < r ){
int m = (l + r) / 2;
if( query( m + 1 , n ) != n - 1 )r = m;
else l = m + 1;
}
i = l;
l = i + 1 , r = n;
while( l < r ){
int m = (l + r) / 2;
if( query( i , m ) != n - 1 )l = m + 1;
else r = m;
}
j = l;
b[i] = 1;
b[j] = n;
if( i != 1 )b[i - 1] = query( i - 1 , i ) + 1;
if( i + 1 < j )b[i + 1] = query( i , i + 1 ) + 1;
if( j - 1 > i + 1 )b[j - 1] = n - query( j - 1 , j );
if( j != n )b[j + 1] = n - query( j , j + 1 );
for( int h = i - 2; h >= 1; h-- ){
int x = query( h , h + 1 );
int y = query( h , h + 2 );
b[h] = get( x , y , b[h + 1] , b[h + 2] );
}
for( int h = i + 2; h <= j - 2; h++ ){
int x = query( h - 1 , h );
int y = query( h - 2 , h );
b[h] = get( x , y , b[h - 1] , b[h - 2] );
}
for( int h = j + 2; h <= n; h++ ){
int x = query( h - 1 , h );
int y = query( h - 2 , h );
b[h] = get( x , y , b[h - 1] , b[h - 2] );
}
for( int h = 1; h <= n; h++ ){
answer( h , b[h] );
}
}
