#include <iostream>
#include <queue>
#include <unordered_map>

using namespace std;

typedef unordered_map<int, int> dict;

void constructQueue( int n ){
    queue<int> Q;
    dict tmp;
    for( int i=1; i<=n; ++i ){
        Q.push( i );
    }
    int cnt = 1;
    while( !Q.empty()){
        int x = Q.front();
        Q.pop();
        Q.push(x);
        x = Q.front();
        tmp.emplace( x, cnt++ );
        Q.pop();
    }
    for( int i=1; i<=n; ++i ){
        if( i!=n )
            cout<<tmp[i]<<" ";
        else
            cout<<tmp[i]<<endl;
    }
}

int main(int argc, char *argv[])
{
    int n;
    cin>>n;
    int num[n];
    for(int i=0; i<n; ++i){
        cin>>num[i];
    }
    for(int i=0; i<n; ++i){
        constructQueue(num[i]);
    }

    return 0;
}