n = int(input())
d = input()
a = [int(x) for x in d.split()]
a1 = a.count(1)
a2 = a.count(2)
if a1==0 or a2==0:
print(d)
else:
l = [2,1]+[2 for i in range(a2-1)]+[1 for i in range(a1-1)]
print(" ".join(map(str,l)))
#define ll long long
#define MAXN 200010
#define INF 0x3f3f3f3f
#include <bits/stdc++.h>
using namespace std;
int main(){
#ifdef _DEBUG
freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
#endif
#define int ll
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int one = 0;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
if (x == 1) {
++one;
}
}
if (one < n) {
cout << "2 ";
--n;
}
if (one) {
cout << "1 ";
--n;
--one;
}
for (int i = 0; i < n - one; ++i) {
cout << "2 ";
}
for (int i = 0; i < one; ++i) {
cout << "1 ";
}
cout << endl;
return 0;
}1200. Minimum Absolute Difference | 1619B - Squares and Cubes |
1619A - Square String | 1629B - GCD Arrays |
1629A - Download More RAM | 1629C - Meximum Array |
1629D - Peculiar Movie Preferences | 1629E - Grid Xor |
1629F1 - Game on Sum (Easy Version) | 2148. Count Elements With Strictly Smaller and Greater Elements |
2149. Rearrange Array Elements by Sign | 2150. Find All Lonely Numbers in the Array |
2151. Maximum Good People Based on Statements | 2144. Minimum Cost of Buying Candies With Discount |
Non empty subsets | 1630A - And Matching |
1630B - Range and Partition | 1630C - Paint the Middle |
1630D - Flipping Range | 1328A - Divisibility Problem |
339A - Helpful Maths | 4A - Watermelon |
476A - Dreamoon and Stairs | 1409A - Yet Another Two Integers Problem |
977A - Wrong Subtraction | 263A - Beautiful Matrix |
180C - Letter | 151A - Soft Drinking |
1352A - Sum of Round Numbers | 281A - Word Capitalization |