The Little Elephant likes permutations. This time he has a permutation A[1], A[2], ..., A[N] of numbers 1, 2, ..., N.

He calls a permutation A good, if the number of its inversions is equal to the number of its local inversions. The number of inversions is equal to the number of pairs of integers (i; j) such that 1 ≤ i < j ≤ N and A[i] > A[j], and the number of local inversions is the number of integers i such that 1 ≤ i < N and A[i] > A[i+1].

The Little Elephant has several such permutations. Help him to find for each permutation whether it is good or not. Print YES for a corresponding test case if it is good and NO otherwise.

-----Input-----

The first line of the input contains a single integer T, the number of test cases. T test cases follow. The first line of each test case contains a single integer N, the size of a permutation. The next line contains N space separated integers A[1], A[2], ..., A[N].

-----Output-----

For each test case output a single line containing the answer for the corresponding test case. It should be YES if the corresponding permutation is good and NO otherwise.

-----Constraints-----
1 ≤ T ≤ 474 

1 ≤ N ≤ 100 

It is guaranteed that the sequence A[1], A[2], ..., A[N] is a permutation of numbers 1, 2, ..., N.

-----Example-----
Input:
4
1
1
2
2 1
3
3 2 1
4
1 3 2 4

Output:
YES
YES
NO
YES

-----Explanation-----
Case 1. Here N = 1, so we have no pairs (i; j) with 1 ≤ i < j ≤ N. So the number of inversions is equal to zero. The number of local inversion is also equal to zero. Hence this permutation is good.

Case 2. Here N = 2, and we have one pair (i; j) with 1 ≤ i < j ≤ N, the pair (1; 2). Since A[1] = 2 and A[2] = 1 then A[1] > A[2] and the number of inversions is equal to 1. The number of local inversion is also equal to 1 since we have one value of i for which 1 ≤ i < N (the value i = 1) and A[i] > A[i+1] for this value of i since A[1] > A[2]. Hence this permutation is also good.

Case 3. Here N = 3, and we have three pairs (i; j) with 1 ≤ i < j ≤ N. We have A[1] = 3, A[2] = 2, A[3] = 1. Hence A[1] > A[2], A[1] > A[3] and A[2] > A[3]. So the number of inversions is equal to 3. To count the number of local inversion we should examine inequalities A[1] > A[2] and A[2] > A[3]. They both are satisfied in our case, so we have 2 local inversions. Since 2 ≠ 3 this permutations is not good.

Case 4. Here we have only one inversion and it comes from the pair (2; 3) since A[2] = 3 > 2 = A[3]. This pair gives also the only local inversion in this permutation. Hence the number of inversions equals to the number of local inversions and equals to one. So this permutation is good.

Source: codechef | Difficulty: UNKNOWN_DIFFICULTY


Solutions:
from sys import stdin
t = int(stdin.readline())

def count(n, arr):
	loc = 0
	glob = 0
	for i in range(n - 1):
		if arr[i] > arr[i + 1]:
			loc += 1
	for i in range(n - 1):
		for j in range(i + 1, n):
			if glob > loc:
				return 0
			if arr[i] > arr[j]:
				glob += 1
	if glob == loc:
		return 1
	return 0
for _ in range(t):
	n = int(stdin.readline())
	arr = list(map(int, stdin.readline().split()))
	result = count(n, arr)
	if result:
		print('YES')
	else:
		print('NO')


def no_total(A):
	for i in range(len(A)):
		for j in range(i + 2, len(A)):
			if A[i] > A[j]:
				return False
	return True
cases = int(input())
for case in range(cases):
	n = int(input())
	A = list(map(int, input().split()))
	if no_total(A):
		print('YES')
	else:
		print('NO')


tc = int(input())
for i in range(tc):
	input()
	ls = list(map(int, input().split(' ')))
	p = 'YES'
	for i in range(1, len(ls) + 1):
		if -1 > i - ls[i - 1] or i - ls[i - 1] > 1:
			p = 'NO'
			break
	print(p)