#include<bits/stdc++.h>
using namespace std;
int binary_search(int a[], int n, int x){
	int low = 0;
	int hight = n - 1;
	while(low <= hight){
		int mid = (low+hight)/2;
		if(x > a[mid]) low = mid +1;
		if(x < a[mid]) hight = mid - 1;
		else return(mid);
	}
	return -1;
}
int main(){
	int t;
	cin >> t;
	while(t--){
		int n;
		cin >> n;
		int a[n];
		for(int i = 0; i < n; i++)cin >> a[i];
		sort(a,a+n);
		int x;cin >> x; int result = binary_search(a,n,x);
		if(result != -1) cout << result << endl;
		else cout << "Not found!"<<endl;
	}
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IGJpbmFyeV9zZWFyY2goaW50IGFbXSwgaW50IG4sIGludCB4KXsKCWludCBsb3cgPSAwOwoJaW50IGhpZ2h0ID0gbiAtIDE7Cgl3aGlsZShsb3cgPD0gaGlnaHQpewoJCWludCBtaWQgPSAobG93K2hpZ2h0KS8yOwoJCWlmKHggPiBhW21pZF0pIGxvdyA9IG1pZCArMTsKCQlpZih4IDwgYVttaWRdKSBoaWdodCA9IG1pZCAtIDE7CgkJZWxzZSByZXR1cm4obWlkKTsKCX0KCXJldHVybiAtMTsKfQppbnQgbWFpbigpewoJaW50IHQ7CgljaW4gPj4gdDsKCXdoaWxlKHQtLSl7CgkJaW50IG47CgkJY2luID4+IG47CgkJaW50IGFbbl07CgkJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKyljaW4gPj4gYVtpXTsKCQlzb3J0KGEsYStuKTsKCQlpbnQgeDtjaW4gPj4geDsgaW50IHJlc3VsdCA9IGJpbmFyeV9zZWFyY2goYSxuLHgpOwoJCWlmKHJlc3VsdCAhPSAtMSkgY291dCA8PCByZXN1bHQgPDwgZW5kbDsKCQllbHNlIGNvdXQgPDwgIk5vdCBmb3VuZCEiPDxlbmRsOwoJfQp9