//
//  
//  
//
//  Created by Krish Narsaria on //.
//
 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,n) for(ll i = 0; i < n; i++)
#define in(a,n) ll a[n]; f(i,n) cin >> a[i]
#define MOD 1000000007

bool isPrime(ll n){
    if(n<=3){return true;}
    for (ll i = 2; i * i <= n; ++i) {
        if (n % i == 0) {
            return false;
        }
    }return true;
}

void solve(){
 
}
 
int main() {
   ios_base::sync_with_stdio(false);
   cin.tie(NULL);
   cout.tie(NULL);
	int t;
	cin>>t;
	while(t--)solve();
	return 0;
}