Problem: Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of the suggested problems. The next line contains n space-separated integers ci ( - 100 ≤ ci ≤ 100) — the cost of the i-th task. The tasks' costs may coinсide.

Output

Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.

Examples

Input

5
1 2 -3 3 3


Output

3 1 2 3 


Input

13
100 100 100 100 100 100 100 100 100 100 100 100 100


Output

100 100 100 100 100 100 100 100 100 100 100 100 100 


Input

4
-2 -2 -2 -2


Output

-2 -2 -2 -2 

Solution (in JAVA):

Solution:

import java.io.*;
import java.util.*;
import static java.math.BigInteger.*;
import java.math.BigInteger;
public class Main{

		void solve()throws Exception
	{
		int n=nextInt();
		ArrayList<Integer>zero=new ArrayList<Integer>();
		ArrayList<Integer>minuse=new ArrayList<Integer>();
		ArrayList<Integer>pos=new ArrayList<Integer>();
		int z=-1;
		for(int i=0;i<n;i++)
		{
			
			int x=nextInt();
			z=x;
			if(x==0)
				zero.add(x);
			else if(x>0)
				pos.add(x);
			else
				minuse.add(x);		
		}
		Collections.sort(pos);
		Collections.sort(minuse);
		ArrayList<Integer>res=new ArrayList<Integer>();
		
		{
			
			if(minuse.size()<=1)
			{
				if(pos.size()>0)
					res=pos;
				else if(zero.size()>0)
					res=zero;
				else
					res=minuse;
				
			}
			else
			{
				for(int i=0;i+2<=minuse.size();i+=2)
				{
					res.add(minuse.get(i));
					res.add(minuse.get(i+1));
				}
				res.addAll(pos);
			}
		}		
		for(int i=0;i<res.size();i++)
		{
			if(i==res.size()-1)
				System.out.println(res.get(i));
			else
				System.out.print(res.get(i)+" ");
		}
	
	
	}	
	
	BufferedReader reader;
	PrintWriter writer;
	StringTokenizer stk;
	void run()throws Exception
	{
		reader=new BufferedReader(new InputStreamReader(System.in));
		stk=null;
		writer=new PrintWriter(System.out);
		solve();
		reader.close();
		writer.close();
	}
	int nextInt()throws Exception
	{
		return Integer.parseInt(nextToken());
	}
	long nextLong()throws Exception
	{	
		return Long.parseLong(nextToken());
	}
	double nextDouble()throws Exception
	{		
		return Double.parseDouble(nextToken());
	}
	String nextString()throws Exception
	{
		return nextToken();
	}
	String nextLine()throws Exception
	{
		return reader.readLine();
	}
	String nextToken()throws Exception
	{
		if(stk==null || !stk.hasMoreTokens())
		{
			stk=new StringTokenizer(nextLine());
			return nextToken();
		}
		return stk.nextToken();
	}
	
	public static void main(String[]a) throws Exception
	{	
		new Main().run();

	}
	
}