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.nio.file.Paths;
    import  java.util.*;
    import  java.io.*;
    public class JavaApplication1 {
     
    //================================================
    //================================================
        // O(long(n))
        static long binpow(long a, long n){
            if (n == 0) return 1;
            if (n % 2 == 1){
                return binpow(a, n-1) * a;
            }else {
                long b = binpow(a, n/2);
                return b * b;
            }
        }
     
        // O(log(min(a,b))
        static long gcd(long a, long b){
            if (b == 0) return a;
            else return gcd(b, a % b);
        }
     
        // O(log(min(a,b))
        static long lcd(long a, long b){
            return a / gcd(a,b) * b;
        }
    //===============================================
    //===============================================
     
        void run(){
            /*try {
                Scanner in = new Scanner(Paths.get("skateboard.in"), "UTF-8");
                PrintWriter out = new PrintWriter("skateboard.out", "UTF-8");
                slove(in, out);
            }catch (IOException e){
                throw new Error(e);
     
            }
            */
            Scanner in = new Scanner(System.in);
            PrintWriter out = new PrintWriter(System.out);
            slove(in, out);
        }
        void  slove(Scanner in, PrintWriter out){
            int n = in.nextInt();
            boolean oneTask = false;
            boolean hasZero = false;
            int[] pro = new int[n];
            
            for(int i = 0; i < n; i++){
                pro[i] = in.nextInt();
            }       
           
           
            
            for(int i = 0; i < n; i++){
                if(pro[i] == 0){
                    hasZero = true;
                    for(int j = i;  j < n-1; j++){
                        pro[j] = pro[j+1];
                    }
                    i--;
                    n = n-1;
                }
            }
            
            Arrays.sort(pro, 0, n);
//            out.flush();
//            out.println();
//            for(int i =0; i< n; i++){
//                out.print(pro[i] + " ");
//                out.flush();
//            }
//            out.println();
//            
            for(int i = n-1; i >= 0; i--){
                
                 if(pro[i] > 0){
                   out.print(pro[i] + " ");
                   out.flush();
                   oneTask = true;
                }
                
                if(pro[i] < 0){
            
                    if((i+1) % 2 == 0 && i != 0){
                        oneTask = true;
                        for(int j = i; j>=0; j--){
                            out.print(pro[j] + " ");
                            out.flush();
                        }
                    }
                    else if(i % 2 == 0 && i != 0){
                        oneTask = true;
                        for(int j = i-1; j>=0; j--){
                            out.print(pro[j] + " ");
                            out.flush();
                        }
                    }
                    else if(i == 0 && oneTask == false){
                        if(hasZero){
                            out.print("0");
                            out.flush();
                            hasZero = false;
                        }else{
                            out.print(pro[i]);
                            out.flush();
                        }
                    }
                    break;
                }
            }
             if(hasZero && oneTask == false){
                            out.print("0");
                            out.flush();
                        }
           
            
        }
    //================================================
    //================================================
        public static void main(String[] args) {
            new JavaApplication1().run();
        }
    }