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.*;
import java.util.*;

public class Solution {

	public static void main(String[] args) throws IOException {
		InputReader in = new InputReader(System.in);
		OutputWriter out = new OutputWriter(System.out);
//		InputReader in = new InputReader("/Users/AMANRAJ/Documents/workspace/Competitive/src/input.txt");
//		OutputWriter out = new OutputWriter("/Users/AMANRAJ/Documents/workspace/Competitive/src/output.txt");
		Task task = new Task();
		int t = 1;
		for (int i = 1; i <= t; i++) task.solve(i, in, out);
		out.close();
	}

	static class Task {
		
		public void solve(int testNumber, InputReader in, OutputWriter out) throws IOException {
			int n = in.nextInt();
			int[] a = in.nextIntArray(n, 0);
			int[] freq = new int[3];
			for (int i = 0; i < n; i++) freq[a[i]]++;
			if (freq[1] >= 3) {
				freq[1] -= 3;
				for (int i = 0; i < 3; i++) out.println("1", " ");
			}
			else if (freq[2] >= 1 && freq[1] >= 1) {
				freq[2]--;
				freq[1]--;
				out.println("2", "1", " ");
			}
			for (int i = 0; i < freq[2]; i++) out.println("2", " ");
			for (int i = 0; i < freq[1]; i++) out.println("1", " ");
 		}
	}
	
	static class InputReader {
		private BufferedReader reader;
		private StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}
		
		public InputReader(String file) throws FileNotFoundException {
			reader = new BufferedReader(new FileReader(file));
			tokenizer = null;
		}
		
		private void tokenize() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
		}

		public String next() {
			tokenize();
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}
		
		public char nextChar() {
			return next().charAt(0);
		}
		
		public float nextFloat() {
			return Float.parseFloat(next());
		}
		
		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int size, int a) {
			tokenize();
			int[] arr=new int[size];
			for(int i = a; i < size; i++) {
				tokenize();
				arr[i] = Integer.parseInt(tokenizer.nextToken());
			}
			return arr;
		}
		
		public long[] nextLongArray(int size, int a) {
			tokenize();
			long[] arr=new long[size];
			for(int i = a; i < size; i++) {
				tokenize();
				arr[i] = Long.parseLong(tokenizer.nextToken());
			}
			return arr;
		}
		
		public float[] nextFloatArray(int size, int a) {
			tokenize();
			float[] arr=new float[size];
			for(int i = a; i < size; i++) {
				tokenize();
				arr[i] = Float.parseFloat(tokenizer.nextToken());
			}
			return arr;
		}

		public double[] nextDoubleArray(int size, int a) {
			tokenize();
			double[] arr=new double[size];
			for(int i = a; i < size; i++) {
				tokenize();
				arr[i] = Double.parseDouble(tokenizer.nextToken());
			}
			return arr;
		}

		public String[] nextStringArray(int size, int a) throws IOException {
			String[] arr=new String[size];
			for(int i = a; i < size; i++) 
				arr[i] = reader.readLine();
			return arr;
		}

		public char[] nextCharArray() throws IOException {
			return reader.readLine().toCharArray();
		}
	}

	static class OutputWriter {
		public PrintWriter pw;

		public OutputWriter(OutputStream stream) {
			pw = new PrintWriter(stream);
		}
		
		public OutputWriter(String file) throws IOException {
			pw = new PrintWriter(new BufferedWriter(new FileWriter(file)));
		}
		
		public void println() {
			pw.println();
		}
		
		public void println(Object... obj) {
			String delimiter = (String) obj[obj.length - 1];
			for (int i = 0 ; i < obj.length - 1; i++) pw.print(obj[i] + delimiter);
		}

		public void close() {
			pw.close();
		}

		public void flush() {
			pw.flush();
		}

		public void printStringArray(String[] arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.println(arr[i]);
			pw.println();
		}
		
		public void printBooleanArray(boolean[] arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.print(arr[i] + delimiter);
			pw.println();
		}

		public void printIntArray(int[] arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.print(arr[i] + delimiter);
			pw.println();
		}

		public void printLongArray(long[] arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.print(arr[i] + delimiter);
			pw.println();
		}

		public void printCharArray(char[] arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.print(arr[i] + delimiter);
			pw.println();
		}

		public void printFloatArray(float[] arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.print(arr[i] + delimiter);
			pw.println();
		}

		public void printDoubleArray(double[] arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.print(arr[i] + delimiter);
			pw.println();
		}
		
		public void printIntArrayList(ArrayList<Integer> arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.print(arr.get(i) + delimiter);
			pw.println();
		}
		
		public void printLongArrayList(ArrayList<Long> arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.print(arr.get(i) + delimiter);
			pw.println();
		}
		
		public void printStringArrayList(ArrayList<String> arr, int a, int b, String delimiter) {
			for(int i = a; i < b; i++)
				pw.print(arr.get(i) + delimiter);
			pw.println();
		}
	}
}
