#include "bits/stdc++.h"
using namespace std;

#define dbg(var) cout<<#var<<"="<<var<<" "
#define nl cout<<"\n"
#define fr(i,n) for(int i=0;i<n;i++)
#define rep(i,a,n) for(int i = a; i <= n; i++)
#define per(i,a,n) for(int i = a; i >= n; i--)
#define vi vector<int>
#define pb push_back
#define itr(i,v) for(auto &i:v)
#define all(v) v.begin(),v.end()
#define sz(v) (int)(v.size())
#define int long long
#define kill(x) {cout << x << "\n"; return;}

constexpr int N = 1e5 + 10;
vector<int> adj[N], hgts[N];
int intime[N],outtime[N],timer;
int ans = 0;
//// approach 0 / //////////////////////////////////////
/// for grandparent ///////////////////////////////////
void dfs(int x,int p = -1, int gp = -1) {
	ans += (gp % 2 == 0);
	for(int c: adj[x]) {
		if(c == p) continue;
		dfs(c,x,p);
	}
}
/// follow up//////////////////////////////////////
// approach 1 binary lifting
// link in description
//
/////////////////////////////////////////////////////
// approach 2 /////////////////////////////////////////////////
void dfs_tour(int x, int p = -1) {
	intime[x] = timer++;
	for(int c: adj[x]) {
		if(c == p) continue;
		dfs_tour(c,x);
	}
	outtime[x] = timer;
}

void dfs_height(int x,int p = -1,int h = 0) {
	hgts[h].emplace_back(x);
	for(int c: adj[x]) {
		if(c == p) continue;
		dfs_height(c, x, h + 1);
	}
}
int calculate_answer() {
   int k ; // given kth parrent
   int ans = 0;
   for(int i = 0 ; i + k < N ; i++) {
   	    int j = 0;
   		for(int anc: hgts[i]) {
   			while(j < (int)hgts[i + k].size() 
   				and outtime[hgts[i + k][j]] <= outtime[anc]) {
   				ans += (anc % 2 == 0);
   				j++;
   			}
   		}
   }
   return ans;
} 
///////////////////////////////////////////////////////
///// Approach 3 //////////////////////////////////////
vector<int> backMytrack;
int k;
void dfs_smart(int x,int p = -1){
	backMytrack.emplace_back(x); // append or push_back
	int bck_sz = backMytrack.size();
	if(bck_sz > k) {
		ans += (backMytrack[bck_sz - 1 - k] % 2 == 0);
	} 
	for(int c: adj[x]) {
		if(c == p) continue;
		dfs_smart(c, x);
	}
	backMytrack.pop_back();
}
////////////////////////////////////////////////////////////
void solve(){
   int n; cin >> n ;


}

int32_t main()
{
   ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
   int tst; cin >> tst; while(tst--)
   {
   	solve();
   }
}