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

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

    queue<int> oddQueue, evenQueue;
    int x;

    for (int i = 0; i < N; ++i) {
        cin >> x;
        if (x % 2 == 0)
            evenQueue.push(x);
        else
            oddQueue.push(x);
    }

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

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

    cout << "." << endl;

    return 0;
}