#include<bits/stdc++.h>
using namespace std;
mt19937 g(time(0));
vector<int>ans,p0;
int n;
inline int ask(vector<int>p){
   cout<<"0 ";for(int i=1;i<=n;i++)cout<<p[i]<<' ';cout<<endl;
   int res;cin>>res;return res;
}
void solve(int l,int r,vector<int>nums){
   if(l==r)return ans[l]=nums[0],void();
   int mid=l+r>>1;
   shuffle(begin(nums),end(nums),g);
   vector<int>L,R;
   for(int i=0;i<nums.size();i+=2){
      if(L.size()==mid-l+1){
         for(int j=i;j<nums.size();j++)R.push_back(nums[j]);
         break;
      }
      if(R.size()==r-mid){
         for(int j=i;j<nums.size();j++)L.push_back(nums[j]);
         break;
      }
      int x=nums[i],y=nums[i+1];
      auto p=p0;
      for(int k=l;k<=mid;k++)p[k]=x;
      for(int k=mid+1;k<=r;k++)p[k]=y;
      int res=ask(p);
      if(res==0){
         L.push_back(y),R.push_back(x);
      }else if(res==2){
         L.push_back(x),R.push_back(y);
      }else{
         p=p0;
         for(int k=l;k<=mid;k++)p[k]=x;
         if(ask(p))L.push_back(x),L.push_back(y);
         else R.push_back(x),R.push_back(y);
      }
   }
   solve(l,mid,L),solve(mid+1,r,R);
}
int main(){
   cin>>n,p0.resize(n+1),ans.resize(n+1);
   if(n==1)return cout<<"1 1"<<endl,0;
   while(1){
      for(int i=1;i<=n;i++)p0[i]=g()%n+1;
      if(!ask(p0))break;
   }
   vector<int>S(n);
   for(int i=0;i<n;i++)S[i]=i+1;
   solve(1,n,S);
   cout<<"1 ";for(int i=1;i<=n;i++)cout<<ans[i]<<' ';cout<<endl;
   return 0;
}