/**
* Author : Tashin.Parvez
* United International University
* Created: 22.04.2024
**/
#include <bits/stdc++.h>
#define faster ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//#define Read(x) freopen(x, "r", stdin)
//#define Write(x) freopen(x, "w", stdout)
#define CRACKED return 0;
#define nl "\n"
using namespace std;
#define newline cout << nl;
// data_type_compressions :
#define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define minusone -1
// I/O :
#define sp " " // space
#define si(n) cin >> n; // input [ si = scan input]
#define output(x) cout << x << nl // output
#define setdec(x) fixed << setprecision(x)
#define len(s) s.length()
#define YES cout << "YES" << nl;
#define Yes cout << "Yes" << nl;
#define NO cout << "NO" << nl;
#define No cout << "No" << nl;
//--------------------------------- Debug --------------------------------
#define deb(n) cout << "Tashin " << #n << " = " << n << nl;
#define tashin cout << "____Tashin____" << nl; // Pointer
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1)
{
cout << name << " = " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args)
{
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " = " << arg1 << " | ";
__f(comma + 1, args...);
}
//--------------------------------- FOR --------------------------------
#define FOR_OVERLOAD(_1, _2, NAME, ...) NAME
#define FOR(...) FOR_OVERLOAD(__VA_ARGS__, FOR_TWO_ARGS, FOR_ONE_ARG)(__VA_ARGS__)
#define FOR_ONE_ARG(n) for(int i = 0; i < (n); i++)
#define FOR_TWO_ARGS(a, b) for(int i = (a); (a) <= (b) ? (i < (b)) : (i > (b)); (a) <= (b) ? ++i : --i)
//-------------------------------- Vector -------------------------------
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define vb vector<bool>
#define vii vector<pair<int, int>>
#define vsi vector<pair<string, int>>
#define pb push_back
#define pob pop_back
#define vmin(a) (*min_element(a.begin(), a.end()))
#define vmax(a) (*max_element(a.begin(), a.end()))
#define vsum(a) accumulate(a.begin(), a.end(), 0LL)
//-------------------------------- Sort -------------------------------
#define all(a) (a).begin(),(a).end()
#define vsort(v) sort(v.begin(), v.end()) // Vector asc
#define vsortrev(v) sort(v.begin(), v.end(), greater<int>()) // Vector dec
#define arrsort(a) sort(a, a + n) // array asc
#define arrsortrev(a) sort(a, a + n, greater<int>()) // array dec
//-------------------------------- pair -------------------------------
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<string, int> psi;
#define mp make_pair
#define ff first
#define ss second
//-------------------------------- Map -------------------------------
#define mpii map<int, int>
#define mpsi map<string, int>
#define mpci map<char, int>
// $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ Some Func $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
//================== Int func's =================
#define min3(a, b, c) min(min(a, b), c)
#define mid3(a, b, c) (a + b + c) - max3(a, b, c) - min3(a, b, c)
#define max3(a, b, c) max(max(a, b), c)
ll revnum (ll n) { ll tmp=n,ans=0,r;while(tmp){r=tmp%10;ans=ans*10+r;tmp/=10;}return ans;}
bool isprime (ll n) {if(n<2)return false;if(n==2)return true;if(n%2==0)return false;for(ll i=3;i<=sqrt(n);i+=2){if(n%i==0)return false;}return true;}
bool issquare (ll x) {ll sq=sqrt(x);return sq*sq==x;}
bool iseven (int n) { return !(n & 1);}
ll POW (ll a, ll b) {if(!b) return 1;ll r=POW(a,b/2);if(b%2) return r*r*a;else return r*r;}
#define suminrange(a, b) ((b * (b + 1)) / 2) - (((a - 1) * (a)) / 2)
//================== string func's =================
ll strtoint (string s) {istringstream ss(s);ll n;ss>>n;return n;}
string inttostr (ll x) {string s;while(x){s+=(char)(x%10)+'0';x/=10;}reverse(all(s));return s;}
#define strtolower(s) transform(s.begin(), s.end(), s.begin(), ::tolower) // make string lowercase
//================== Char func's =================
int getASCII(char c) { return c;}
//================== Print func's =================
void printarr (int arr[], int len) { for (int i = 0; i < len; i++) (i + 1 == len) ? cout << arr[i] << nl : cout << arr[i] << " ";}
void printvec (const vector<int>& vec) { for (size_t i = 0; i < vec.size(); ++i) { if (i + 1 == vec.size()) cout << vec[i] << nl; else cout << vec[i] << " "; } }
/************************************************* CODE NOW *************************************************/
/*
1. Think Greedy
2. Think Brute Force
3. Think solution in reverse order
4. Think DP [ check constraints carefully ]
5. Check base cases for DP and prove solution for Greedy
6. Think Graph
7. SubArray / Continious / SubSegment = PrefixSum
*/
const double PI = 3.1415926535;
const int inf = 1e18;
const int mod = 1000000007;
void solution() // main solution
{
int a, b, c, d;
int i, j, k, l, m, n, q;
int x, y, z, t;
string s;
bool flag = false;
int ans, cnt = 0, idx = -1, sum = 0;
cin >> n;
// newline;
}
int32_t main()
{
faster;
int t = 1;
cin >> t;
int c = 1;
while (t--)
{
// cout << "Case " << c++ << ": ";
solution();
}
CRACKED;
}