from collections import defaultdict as dd
from collections import deque
import bisect
import heapq
def ri():
return int(input())
def rl():
return list(map(int, input().split()))
def solve():
n = ri()
lo = 1
hi = (n + 2) // 2
ans = []
for i in range(n // 2):
ans.extend([hi, lo])
hi += 1
lo += 1
if n % 2: ans.append(n)
print (*ans)
mode = 'T'
if mode == 'T':
t = ri()
for i in range(t):
solve()
else:
solve()
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl "\n"
#define intt __int128_t
#define all(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define x first
#define y second
int main() {
fast_cin();
ll t;
cin >> t;
while(t--){
ll n;
cin >> n;
if (n < 4){
for (int i = 1; i <= n; i++){
cout << i << " ";
}
cout << endl;
continue;
}
if (n == 4){
cout << "2 4 1 3" << endl;
continue;
}
for (int i = 1; i <= n/2 + n%2; i++){
if (n%2 == 1){
cout << i << " ";
if (i <= n/2){
cout << i + n/2 + n%2 << " ";
}
} else {
cout << i + n/2 + n%2 << " " << i << " ";
}
}
cout << endl;
}
return 0;
}
1609C - Complex Market Analysis | 1657E - Star MST |
1143B - Nirvana | 1285A - Mezo Playing Zoma |
919B - Perfect Number | 894A - QAQ |
1551A - Polycarp and Coins | 313A - Ilya and Bank Account |
1469A - Regular Bracket Sequence | 919C - Seat Arrangements |
1634A - Reverse and Concatenate | 1619C - Wrong Addition |
1437A - Marketing Scheme | 1473B - String LCM |
1374A - Required Remainder | 1265E - Beautiful Mirrors |
1296A - Array with Odd Sum | 1385A - Three Pairwise Maximums |
911A - Nearest Minimums | 102B - Sum of Digits |
707A - Brain's Photos | 1331B - Limericks |
305B - Continued Fractions | 1165B - Polycarp Training |
1646C - Factorials and Powers of Two | 596A - Wilbur and Swimming Pool |
1462B - Last Year's Substring | 1608B - Build the Permutation |
1505A - Is it rated - 2 | 169A - Chores |