//
//  
//  
//
//  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;
}

Ly8KLy8gIAovLyAgCi8vCi8vICBDcmVhdGVkIGJ5IEtyaXNoIE5hcnNhcmlhIG9uIC8vLgovLwogCiNpbmNsdWRlIDxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwojZGVmaW5lIGxsIGxvbmcgbG9uZwojZGVmaW5lIGYoaSxuKSBmb3IobGwgaSA9IDA7IGkgPCBuOyBpKyspCiNkZWZpbmUgaW4oYSxuKSBsbCBhW25dOyBmKGksbikgY2luID4+IGFbaV0KI2RlZmluZSBNT0QgMTAwMDAwMDAwNwoKYm9vbCBpc1ByaW1lKGxsIG4pewogICAgaWYobjw9Myl7cmV0dXJuIHRydWU7fQogICAgZm9yIChsbCBpID0gMjsgaSAqIGkgPD0gbjsgKytpKSB7CiAgICAgICAgaWYgKG4gJSBpID09IDApIHsKICAgICAgICAgICAgcmV0dXJuIGZhbHNlOwogICAgICAgIH0KICAgIH1yZXR1cm4gdHJ1ZTsKfQoKdm9pZCBzb2x2ZSgpewogCn0KIAppbnQgbWFpbigpIHsKICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgIGNpbi50aWUoTlVMTCk7CiAgIGNvdXQudGllKE5VTEwpOwoJaW50IHQ7CgljaW4+PnQ7Cgl3aGlsZSh0LS0pc29sdmUoKTsKCXJldHVybiAwOwp9