#include "inv.h"
#include <bits/stdc++.h>
#define N 2005
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int nn;
map<int,int>mp;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int gs(int l,int r){
    if(mp.find(l*(nn+1)+r)!=mp.end())return mp[l*(nn+1)+r];
    return mp[l*(nn+1)+r]=query(l,r);
}
bool cmp(int x,int y){
    int ans=0;
    if(x>y)swap(x,y),ans=1;
    if(x==y)return ans;
    if(x+1==y)return (gs(x,y)==0)^ans;
    if(x+2==y)return (gs(x,y)^gs(x,y-1)^gs(x+1,y)==0)^ans;
    return (gs(x,y)^gs(x+1,y)^gs(x,y-1)^gs(x+1,y-1)==0)^ans;
}
void init(int c, int t){
    
}

std::vector<int> solve(int n){
    nn=n;mp.clear();
    int a[N];fo(i,1,n)a[i]=i;
    sort(a+1,a+n+1,cmp);
    vector<int>ans(n);
    fo(i,1,n)ans[a[i]-1]=i;
    return ans;
}