Problem: Vitaly has an array of n distinct integers. Vitaly wants to divide this array into three non-empty sets so as the following conditions hold: 

  1. The product of all numbers in the first set is less than zero ( < 0). 
  2. The product of all numbers in the second set is greater than zero ( > 0). 
  3. The product of all numbers in the third set is equal to zero. 
  4. Each number from the initial array must occur in exactly one set. 



Help Vitaly. Divide the given array.

Input

The first line of the input contains integer n (3 ≤ n ≤ 100). The second line contains n space-separated distinct integers a1, a2, ..., an (|ai| ≤ 103) — the array elements.

Output

In the first line print integer n1 (n1 > 0) — the number of elements in the first set. Then print n1 numbers — the elements that got to the first set.

In the next line print integer n2 (n2 > 0) — the number of elements in the second set. Then print n2 numbers — the elements that got to the second set.

In the next line print integer n3 (n3 > 0) — the number of elements in the third set. Then print n3 numbers — the elements that got to the third set.

The printed sets must meet the described conditions. It is guaranteed that the solution exists. If there are several solutions, you are allowed to print any of them.

Examples

Input

3
-1 2 0


Output

1 -1
1 2
1 0


Input

4
-1 -2 -3 0


Output

1 -1
2 -3 -2
1 0

Solution (in PYTHON):

Solution:
n = int(raw_input())
v = map(int, raw_input().split())

less = []
greater = []
zero = []

for x in v:
	if x < 0:
		less.append(x)
	elif x > 0:
		greater.append(x)
	else:
		zero.append(x)
begg = 0
begl = 1
print 1, less[0]
if len(greater) > 0:
	print 1, greater[0]
	begg = 1
else:
	print 2, less[1], less[2]
	begl = 3
print "%d" % (len(less)-begl+len(greater)-begg+len(zero)),
for i in range(begl, len(less)):
	print "%d" % less[i],
for i in range(begg, len(greater)):
	print "%d" % greater[i],
for i in range(len(zero)):
	print "%d" % zero[i],