You are given a permutation of 1,2,...,N: p_1,p_2,...,p_N. Determine if the state where p_i=i for every i can be reached by performing the following operation any number of times:
 - Choose three elements p_{i-1},p_{i},p_{i+1} (2\leq i\leq N-1) such that p_{i-1}>p_{i}>p_{i+1} and reverse the order of these three.

-----Constraints-----
 - 3 \leq N \leq 3 × 10^5
 - p_1,p_2,...,p_N is a permutation of 1,2,...,N.

-----Input-----
Input is given from Standard Input in the following format:
N
p_1
:
p_N

-----Output-----
If the state where p_i=i for every i can be reached by performing the operation, print Yes; otherwise, print No.

-----Sample Input-----
5
5
2
1
4
3

-----Sample Output-----
Yes

The state where p_i=i for every i can be reached as follows:
 - Reverse the order of p_1,p_2,p_3. The sequence p becomes 1,2,5,4,3.
 - Reverse the order of p_3,p_4,p_5. The sequence p becomes 1,2,3,4,5.

Difficulty: VERY_HARD

Solutions:
def Split(a):
	no = []
	for (i, x) in a:
		if no:
			is_ok = i == x
			la_ok = no[-1][0] == no[-1][1]
			if is_ok == la_ok:
				yield no
				no = []
		no.append((i, x))
	yield no
n = int(input())
p = list(enumerate((int(input()) for i in range(n)), 1))
for sq in Split(p):
	tl = tr = 0
	for (np, goal) in sq:
		if goal > np:
			if goal < tr or goal > sq[-1][0]:
				print('No')
				exit(0)
			tr = goal
		elif goal < np:
			if goal < tl or goal < sq[0][0]:
				print('No')
				exit(0)
			tl = goal
print('Yes')


def Split(a):
	no = []
	for (i, x) in a:
		if no and (i == x) == (no[-1][0] == no[-1][1]):
			yield no
			no = []
		no.append((i, x))
	yield no
for sq in Split(((i + 1, int(input())) for i in range(int(input())))):
	tb = [0, 0]
	for (np, goal) in sq:
		if goal != np:
			if goal < tb[np < goal] or goal > sq[-1][0] or goal < sq[0][0]:
				print('No')
				return
			tb[np < goal] = goal
print('Yes')