Problem: According to an old legeng, a long time ago Ankh-Morpork residents did something wrong to miss Fortune, and she cursed them. She said that at some time n snacks of distinct sizes will fall on the city, and the residents should build a Snacktower of them by placing snacks one on another. Of course, big snacks should be at the bottom of the tower, while small snacks should be at the top.

Years passed, and once different snacks started to fall onto the city, and the residents began to build the Snacktower.

<image>

However, they faced some troubles. Each day exactly one snack fell onto the city, but their order was strange. So, at some days the residents weren't able to put the new stack on the top of the Snacktower: they had to wait until all the bigger snacks fell. Of course, in order to not to anger miss Fortune again, the residents placed each snack on the top of the tower immediately as they could do it.

Write a program that models the behavior of Ankh-Morpork residents.

Input

The first line contains single integer n (1 ≤ n ≤ 100 000) — the total number of snacks.

The second line contains n integers, the i-th of them equals the size of the snack which fell on the i-th day. Sizes are distinct integers from 1 to n. 

Output

Print n lines. On the i-th of them print the sizes of the snacks which the residents placed on the top of the Snacktower on the i-th day in the order they will do that. If no snack is placed on some day, leave the corresponding line empty.

Examples

Input

3
3 1 2


Output

3
 
2 1

Input

5
4 5 1 2 3


Output

 
5 4
 
 
3 2 1

Note

In the example a snack of size 3 fell on the first day, and the residents immediately placed it. On the second day a snack of size 1 fell, and the residents weren't able to place it because they were missing the snack of size 2. On the third day a snack of size 2 fell, and the residents immediately placed it. Right after that they placed the snack of size 1 which had fallen before.

Solution (in PYTHON):

Solution:
### max heap implementation
class heap:
	def __init__(self):
		self.size = -1
		self.arr = []

	def left(self, i):
		return 2*i+1

	def right(self, i):
		return 2*i+2

	def parent(self, i):
		return (i-1)//2

	def push(self, x):
		self.arr.append(x)
		self.size += 1
		i = self.size
		p = self.parent(i)
		while (i>0) and (self.arr[p]<self.arr[i]):
			self.arr[p], self.arr[i] = self.arr[i], self.arr[p]
			i = p
			p = self.parent(i)

	def heapify(self, i):
		while 1:
			leftChild = self.left(i)
			rightChild = self.right(i)
			largestChild = i
			if (leftChild <= self.size) and ( self.arr[leftChild] > self.arr[largestChild] ):
				largestChild = leftChild
			if (rightChild <= self.size) and ( self.arr[rightChild] > self.arr[largestChild] ):
				largestChild = rightChild
			if largestChild == i:
				break
			self.arr[largestChild], self.arr[i] = self.arr[i], self.arr[largestChild]

			i = largestChild

	def pop(self):
		if self.size >= 0:
			self.arr[0], self.arr[self.size] = self.arr[self.size], self.arr[0]
			maxEl = self.arr.pop()
			self.size -= 1
			self.heapify(0)
			return maxEl
		else:
			return None

	def get_max(self):
		if self.size >= 0:
			maxEl = self.arr[0]
			return maxEl
		else:
			return None





################# main code here ######################
# read input
N = int(raw_input())
input_seq = map(int, raw_input().split())

output_seq =  [[] for i in range(N)]


snackovik_to_put = N

# create a heap to store snacks
h = heap()

for day, snack in enumerate(input_seq):
	# if fallen snack fits put it on snekovik
	# otherwise store it in the heap
	if snack == snackovik_to_put:
		output_seq[day].append(snack)
		snackovik_to_put -= 1
	else:
		h.push(snack)
	# check if we can put some snacks from
	# the heap on the snekovik
	
	heap_max = h.get_max()
	
	while heap_max==snackovik_to_put:
		snack = h.pop()
		output_seq[day].append(snack)
		snackovik_to_put -= 1
		heap_max = h.get_max()


for l in output_seq:
	print ' '.join(map(str,l))