#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const long long mod = 1e9 + 7;
const int alphabet = 26;
const int inf = INT_MAX;
const long long linf = 1e18 + 9;
namespace util {
inline long long cnm(char ch) { return (ch - '0'); }
inline long long cap(char ch) { return (ch - 'a'); }
inline void instr(string& s, long long& n) {
  cin >> s;
  n = s.length();
}
inline void instr(string& s) { cin >> s; }
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
bool min(T a, T b, T c) {
  return std::min(a, std::min(b, c));
}
}  // namespace util
using namespace util;
void solve(int tc) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long i, j, k, m, n;
  cin >> n;
  long long cnt1 = 0, cnt2 = 0;
  for (i = 0; i < n; i++) {
    long long x;
    cin >> x;
    if (x == 1)
      cnt1 += 1;
    else
      cnt2 += 1;
  }
  if (cnt2 > 0) {
    cout << "2 ";
    cnt2 -= 1;
  }
  if (cnt1 > 0) {
    cout << "1 ";
    cnt1 -= 1;
  }
  while (cnt2 > 0) {
    cout << "2 ";
    cnt2 -= 1;
  }
  while (cnt1 > 0) {
    cout << "1 ";
    cnt1 -= 1;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  int i = 1;
  while (i <= t) {
    solve(i);
    i++;
  }
  return 0;
}
