#include<bits/stdc++.h>

using namespace std;
#define endl '\n'
#define ll long long int
#define pi 3.141592653589793238
#define vv vector<long long>
#define dq deque<long long>
#define mpp map<long long,long long>
#define ms multiset<long long>
#define ss set<long long>
#define pq priority_queue<ll>
#define vpp vector<pair<long long, long long>>
#define MOD 1000000007
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
#define all(a) a.begin(),a.end()
#define sort_rev(a) sort(a.rbegin(),a.rend())
#define print(a) for(auto it:a)cout<<it<<" "
#define print_pair(a) for(auto it:a)cout<<it.first<<" "<<it.second<<endl
#define scan(a, n) for(int i=0;i<n;i++)cin>>a[i]

void requisite() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

ll expo(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1) res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

int isOk(ll mid, vv &v, ll val) {
    if (v[mid] >= val) return 1;
    else return 0;
}

void solve() {
    ll n;cin>>n;
    vv v;
    for (int i = 1; i <=n; ++i) {
        v.push_back(i);
    }
    ll i=0;
    while (i<n){
        if (i==n-1 and v[n-1]==i+1)swap(v[i],v[i-1]);
        else if(v[i]==i+1)swap(v[i],v[i+1]);

        i++;
    }
    print(v);cout<<endl;
}

int main() {
    requisite();
    ll t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}