#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const LL N = 1e7 + 7;
LL a[N], o[N], oi, j[N], ji; 
int main() {
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	for (int i = 1; i <= n; i++) {
		if (a[i]%2 == 0) {
			o[oi] = a[i];
			oi++;
		}
		else if (a[i]%2 != 0) {
			j[ji] = a[i];
			ji++;
		}
	}
	for (int i = 1; i <= ji; i++)
		printf("%d ", j[i]);
	puts("");
	for (int i = 1; i <= oi; i++)
		printf("%d ", o[i]);
	return 0;
}