We're giving away nice huge bags containing number tiles! A bag we want to present to you contains n tiles. Each of them has a single number written on it — either 1 or 2.

However, there is one condition you must fulfill in order to receive the prize. You will need to put all the tiles from the bag in a sequence, in any order you wish. We will then compute the sums of all prefixes in the sequence, and then count how many of these sums are prime numbers. If you want to keep the prize, you will need to maximize the number of primes you get.

Can you win the prize? Hurry up, the bags are waiting!

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of number tiles in the bag. The following line contains n space-separated integers a_1, a_2, ..., a_n (a_i ∈ \{1, 2\}) — the values written on the tiles.

Output

Output a permutation b_1, b_2, ..., b_n of the input sequence (a_1, a_2, ..., a_n) maximizing the number of the prefix sums being prime numbers. If there are multiple optimal permutations, output any.

Examples

Input


5
1 2 1 2 1


Output


1 1 1 2 2


Input


9
1 1 2 1 1 1 2 1 1


Output


1 1 1 2 1 1 1 2 1

Note

The first solution produces the prefix sums 1, \mathbf{\color{blue}{2}}, \mathbf{\color{blue}{3}}, \mathbf{\color{blue}{5}}, \mathbf{\color{blue}{7}} (four primes constructed), while the prefix sums in the second solution are 1, \mathbf{\color{blue}{2}}, \mathbf{\color{blue}{3}}, \mathbf{\color{blue}{5}}, 6, \mathbf{\color{blue}{7}}, 8, 10, \mathbf{\color{blue}{11}} (five primes). Primes are marked bold and blue. In each of these cases, the number of produced primes is maximum possible.
import java.io.BufferedWriter;
	import java.io.IOException;
	import java.io.InputStream;
	import java.io.OutputStream;
	import java.io.OutputStreamWriter;
	import java.io.PrintWriter;
	import java.io.Writer;
	import java.util.Arrays;
	import java.util.InputMismatchException;
	import java.util.*;
	import java.io.*;
	import java.math.*;
	public class Main7{

	static class Pair
		{ 
			int x; 
			int y;
			int z;
			public Pair(int x, int y, int z) 
			{	 
				this.x = x; 
				this.y = y;
				this.z=z;
			}	 
		} 
		static class Pair1
		{
			String x;
			int y;
			int z;
			
		}
		static class Compare
		{ 
			static void compare(Pair arr[], int n) 
			{ 
				// Comparator to sort the pair according to second element 
				Arrays.sort(arr, new Comparator<Pair>() { 
					@Override public int compare(Pair p1, Pair p2) 
					{ 
						if(p1.z>p2.z)
						{
							return 1;
						}
						else if(p1.z<p2.z)
						{
							return -1;
						}
						else
						{
							if(p1.z==1)
							{
								if(p1.y>p2.y)
								{
									return -1;
								}
								else
								{
									return 1;
								}
							}
							else if(p1.z==2)
							{
								if(p1.x>p2.x)
								{
									return -1;
								}
								else
								{
									return 1;
								}
							}
							else if(p1.z==3)
							{
								if(p1.y>p2.y)
								{
									return 1;
								}
								else
								{
									return -1;
								}
							}
							else if(p1.z==4)
							{
								if(p1.x>p2.x)
								{
									return 1;
								}
								else
								{
									return -1;
								}
							}
							return 0;
						} 
					} 
				}); 
			} 
		}
		
		static class pqcomparator implements Comparator<Pair>
		{
		                // for Ascending order of cgpa 
            public int compare(Pair s1, Pair s2) { 
                if (s1.x > s2.x) 
                    return -1; 
                else if (s1.x < s2.x) 
                    return 1; 
                return 0; 
                } 
        } 
		
		
		public static long pow(long a, long b)
		{
			long result=1;
			while(b>0)
			{
				if (b % 2 != 0)
				{
					result=(result*a)%mod;
					b--;
				} 
				a=(a*a)%mod;
				b /= 2;
			}   
			return result;
		}
		public static long fact(long num)
		{
					long value=1;
					int i=0;
					for(i=2;i<num;i++)
					{
						value=((value%mod)*i%mod)%mod;
					}
					return value;
				}
				public static long gcd(long a, long b)
				{
					if (a == 0)
						return b;
					return gcd(b%a, a);
				}
				
				public static long lcm(long a,long b)
				{
					return a * (b / gcd(a, b));
				}
				public static long sum(int h)
				{
					return (h*(h+1)/2);
				}
				/*public static void dfs(int parent,boolean[] visited)
				{
					TreeSet<Integer> arr=new TreeSet<Integer>();
					arr=graph.get(parent);
					visited[parent]=true;
					if(a[parent]==1)
					{
						flag=1;
					}
					if(a[parent]==2)
					{
						flag1=1;
					}
					if(flag==1 && flag1==1)
					{
						return;
					}
					Iterator itr=arr.iterator();
					while(itr.hasNext())
					{
						int num=(int)itr.next();
						if(visited[num]==false)
						{
							dfs(num,visited);
						}
					}
					
				}*/
			//	static int flag1=0;
				static int[] dis;
				static long mod=64735492;
				static ArrayList<ArrayList<Integer>> graph;
				
			//	static int[] a;			  
				
				public static int[] sort(int[] a)
				{
					int n=a.length;
					ArrayList<Integer> ar=new ArrayList<>();
					for(int i=0;i<a.length;i++)
					{
						ar.add(a[i]);
					}
					Collections.sort(ar);
					for(int i=0;i<n;i++)
					{
						a[i]=ar.get(i);
					}
					return a;
				}
			//	static int flag=1;
			
			
			static void initializeDiffArray(int A[], int D[])
            {
                int n = A.length;
                D[0] = A[0];
                D[n] = 0;
                for (int i = 1; i < n; i++)
                    D[i] = A[i] - A[i - 1];
            }
            // Does range update
            static void update(int D[], int l, int r, int x)
            {
                D[l] += x;
                D[r + 1] -= x;
            }
            // Prints updated Array
        static ArrayList<Integer> printArray(int A[], int D[])
        {
			int max=0;
			int index=0;
			ArrayList<Integer> ar=new ArrayList<Integer>();
            for (int i = 0; i < A.length; i++) {
                if (i == 0)
                    A[i] = D[i];
 
            // Note that A[0] or D[0] decides
            // values of rest of the elements.
            else
                A[i] = D[i] + A[i - 1];
			if(max<A[i])
			{
				max=A[i];
				index=i;
			}
         //   System.out.print(A[i] + " ");
        }
		//    System.out.println();
			ar.add(max);
			ar.add(index);
        	return ar;
        //    return 0;
        }
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
				public static void main(String args[])throws IOException
				{
				//	InputReader in=new InputReader(System.in);
				//	OutputWriter out=new OutputWriter(System.out);
				//	long a=pow(26,1000000005);
				    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
					ArrayList<Integer> ar4=new ArrayList<>();
					ArrayList<Integer> ar2=new ArrayList<>();
					
					ArrayList<Integer> ar1=new ArrayList<>();
					TreeSet<Integer> ts=new TreeSet<>();
					TreeSet<Long> ts1=new TreeSet<>();
					HashMap<Long,Integer> hash=new HashMap<>();
					HashMap<Integer,Integer> odd=new HashMap<Integer,Integer>();
					HashMap<Long,Integer> hash2=new HashMap<Long,Integer>();
					boolean[] prime=new boolean[5000001];
					for(int i=2;i*i<=5000000;i++)
					{
						if(prime[i]==false)
						{
							for(int j=2*i;j<=5000000;j+=i)
							{
								prime[j]=true;
							}
						}
					}
					for(int i=2;i<=200000;i++)
					{
						if(prime[i]==false)
						{
							ar1.add(i);
						}
					}
					int n=i();
					int[] a=new int[n];
					for(int i=0;i<n;i++)
					{
						a[i]=i();
						ts.add(a[i]);
					}
					a=sort(a);
					int[] diff=new int[ar1.size()];
					for(int i=0;i<ar1.size();i++)
					{
						if(i==0)
						{
							
						}
						else
						{
							diff[i]=ar1.get(i)-ar1.get(i-1);
						}
					}
					if(n==1)
					{
						pln(a[0]+"");
					}
					else if(n==2)
					{
						if(ts.contains(2))
						{
							pln(2+" "+a[0]);
						}
						else
						{
							pln(a[0]+" "+a[1]);
						}
					}
					else
					{
					//	pln(diff[1]+" "+diff[2]+" "+diff[3]);
						int index=0;
						for(int i=0;i<n;i++)
						{
							if(a[i]==2)
							{
								index=i;
								break;
							}
						}
						if(ts.contains(2))
						{
							ar2.add(2);
							int first=0;
							if(ts.contains(1))
							{
								ar2.add(1);
								first++;
							}
							for(int i=n-2;i>=first;i--)
							{
								ar2.add(a[i]);
							}
						}
						else
						{
							for(int i=0;i<n;i++)
							{
								ar2.add(a[i]);
							}
						}
						
					for(int i=0;i<ar2.size();i++)
					{
						System.out.print(ar2.get(i)+" ");
					}
					pln("");
					}
				}
				
				
				
				
				
				/**/
				static InputReader in=new InputReader(System.in);
					static OutputWriter out=new OutputWriter(System.out);
					public static long l()
					{
						String s=in.String();
						return Long.parseLong(s);
					}
					public static void pln(String value)
					{
						System.out.println(value);
					}
					public static int i()
					{
						return in.Int();
					}
					public static String s()
					{
						return in.String();
					}
		}
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			class InputReader {
				 
				private InputStream stream;
				private byte[] buf = new byte[1024];
				private int curChar;
				private int numChars;
				private SpaceCharFilter filter;
			 
				public InputReader(InputStream stream) {
					this.stream = stream;
				}
			 
				public int read() {
					if (numChars== -1)
						throw new InputMismatchException();
					if (curChar >= numChars) {
						curChar = 0;
						try {
							numChars = stream.read(buf);
						} catch (IOException e) {
							throw new InputMismatchException();
						}
						if (numChars <= 0)
							return -1;
					}
					return buf[curChar++];
				}
			 
				public int Int() {
					int c = read();
					while (isSpaceChar(c))
						c = read();
					int sgn = 1;
					if (c == '-') {
						sgn = -1;
						c = read();
					}
					int res = 0;
					do {
						if (c < '0' || c > '9')
							throw new InputMismatchException();
						res *= 10;
						res += c - '0';
						c = read();
					} while (!isSpaceChar(c));
					return res * sgn;
				}
			 
				public String String() {
					int c = read();
					while (isSpaceChar(c))
						c = read();
					StringBuilder res = new StringBuilder();
					do {
						res.appendCodePoint(c);
						c = read();
					} while (!isSpaceChar(c));
					return res.toString();
				}
			 
				public boolean isSpaceChar(int c) {
					if (filter != null)
						return filter.isSpaceChar(c);
					return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
				}
			 
				public String next() {
					return String();
				}
			 
				public interface SpaceCharFilter {
					public boolean isSpaceChar(int ch);
				}
			}
			 
			class OutputWriter {
				private final PrintWriter writer;
			 
				public OutputWriter(OutputStream outputStream) {
					writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
				}
			 
				public OutputWriter(Writer writer) {
					this.writer = new PrintWriter(writer);
				}
			 
				public void print(Object...objects) {
					for (int i = 0; i < objects.length; i++) {
						if (i != 0)
							writer.print(' ');
						writer.print(objects[i]);
					}
				}
			 
				public void printLine(Object...objects) {
					print(objects);
					writer.println();
				}
			 
				public void close() {
					writer.close();
				}
			 
				public void flush() {
					writer.flush();
				}
			 
				}
			 
				class IOUtils {
			 
				public static int[] readIntArray(InputReader in, int size) {
					int[] array = new int[size];
					for (int i = 0; i < size; i++)
						array[i] = in.Int();
					return array;
				}
			 
				} 