#include <iostream>
#include <queue>
using namespace std;

int main() {
    int N;
    cin >> N;

    queue<int> oddQueue;
    queue<int> evenQueue;

    for (int i = 0; i < N; ++i) {
        int num;
        cin >> num;

        if (num % 2 == 0)
            evenQueue.push(num);
        else
            oddQueue.push(num);
    }

    while (!oddQueue.empty()) {
        cout << oddQueue.front() << " ";
        oddQueue.pop();
    }

    while (!evenQueue.empty()) {
        cout << evenQueue.front() << " ";
        evenQueue.pop();
    }
    cout << endl;
    return 0;
}