#include <iostream>
#include <algorithm>
using namespace std;
int n, a[1010];
int cmp (int a, int b)
{
if ((a & 1) != (b & 1)) return (a & 1) > (b & 1);
return a < b;
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++) cin >> a[i];
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= n; i ++) cout << a[i] << ' ';
return 0;
}