Given an array A. Delete an single element from the array such that sum of the differences of adjacent elements should be minimum.  

For more clarification Sum for an array A having N element is defined as :  
abs( A[0] - A[1] )  + abs( A[1] - A[2] ) + abs( A[2] - A[3] ) +............ + abs( A[N-2] - A[N-1] )    

Input:
First line contains number of test cases T. Each test cases contains two lines. First line contains an integer N, size of the array and second line contains N space separated elements of array A.   

Output:
For each test case print the index of the element in the array A, which if deleted, minimizes the value of the sum.. If there is multiple answer possible print the lowest index value.  

NOTE:
We are using is 0-based indexing for array.  

Constraints:
1 ≤ T ≤ 5
1<N ≤ 100000
1 ≤ Arri ≤ 10^9

SAMPLE INPUT
1
5
1 10 20 40 60

SAMPLE OUTPUT
4
t=int(raw_input())
for qq in xrange(t):
	n=int(raw_input())
	l=map(int,raw_input().split())
	s=sum(l)
	minval=9999999999999999999
	ret=0
	if n==1:
		print 0
		continue
	for i in xrange(n):
		tmp=0
		cp=s
		if i>0 and i<n-1:
			tmp = abs(l[i]-l[i-1]) + abs(l[i]-l[i+1])
			cp-=tmp
			cp+=abs(l[i+1]-l[i-1])
			if cp < minval:
				minval = cp
				ret=i
		elif i==0:
			cp-=abs(l[0]-l[1])
			if cp < minval:
				minval = cp
				ret=i
		else:
			cp-=abs(l[n-2]-l[n-1])
			if cp < minval:
				minval = cp
				ret=i
	print ret