T = int(input())
for t in range(T):
	N = int(input())
	A = list(map(int, input().split()))
 
	Acopy = A[:]
	Acopy.sort()
	k = 1
	replacement = {}
	for x in Acopy:
		if x not in replacement:
			replacement[x] = k
			k += 1
 
	A = [replacement[Ai] for Ai in A]
 
	last = [-1]*100005
	for i in range(len(A)-1, -1, -1):
		if last[A[i]]==-1:
			last[A[i]] = i
 
	pre = [-1]*100005
	pre[0] = last[0]
	for i in range(1, len(last)):
		pre[i] = max(pre[i-1], last[i])
 
	best = 0
	for i in range(N):
		subarray_size = pre[A[i]] - i + 1
		best = max(best, subarray_size)
 
	print(best)

VCA9IGludChpbnB1dCgpKQpmb3IgdCBpbiByYW5nZShUKToKCU4gPSBpbnQoaW5wdXQoKSkKCUEgPSBsaXN0KG1hcChpbnQsIGlucHV0KCkuc3BsaXQoKSkpCgkKCUFjb3B5ID0gQVs6XQoJQWNvcHkuc29ydCgpCglrID0gMQoJcmVwbGFjZW1lbnQgPSB7fQoJZm9yIHggaW4gQWNvcHk6CgkJaWYgeCBub3QgaW4gcmVwbGFjZW1lbnQ6CgkJCXJlcGxhY2VtZW50W3hdID0gawoJCQlrICs9IDEKCQoJQSA9IFtyZXBsYWNlbWVudFtBaV0gZm9yIEFpIGluIEFdCgkKCWxhc3QgPSBbLTFdKjEwMDAwNQoJZm9yIGkgaW4gcmFuZ2UobGVuKEEpLTEsIC0xLCAtMSk6CgkJaWYgbGFzdFtBW2ldXT09LTE6CgkJCWxhc3RbQVtpXV0gPSBpCgkKCXByZSA9IFstMV0qMTAwMDA1CglwcmVbMF0gPSBsYXN0WzBdCglmb3IgaSBpbiByYW5nZSgxLCBsZW4obGFzdCkpOgoJCXByZVtpXSA9IG1heChwcmVbaS0xXSwgbGFzdFtpXSkKCQkKCWJlc3QgPSAwCglmb3IgaSBpbiByYW5nZShOKToKCQlzdWJhcnJheV9zaXplID0gcHJlW0FbaV1dIC0gaSArIDEKCQliZXN0ID0gbWF4KGJlc3QsIHN1YmFycmF5X3NpemUpCgkKCXByaW50KGJlc3Qp

NAo1CjUgNCAzIDIgMQo1CjQgNCA0IDQgNAo0CjEgMiAzIDQKNQoxIDMgNSAyIDQ=

4
5
5 4 3 2 1
5
4 4 4 4 4
4
1 2 3 4
5
1 3 5 2 4