#include <iostream>
#include <algorithm>

using namespace std;


const int N = 10;

bool compare(int l, int r){
    if(l % 2 == 1 && r % 2 == 0)
        return true;
    return false;
}

bool re(int l, int r){
    return l >= r;
}


int main(){
    int odd = 0;
    int arr[N];
    for(int i = 0; i < N; ++ i)
        cin >> arr[i];
    sort(arr, arr + N, compare);

    for(int i = 0; arr[i] % 2 == 1; ++i)
        ++odd;
    sort(arr, arr + odd, re);
    sort(arr + odd, arr + N);

    for(int i = 0; i < N; ++ i)
        cout << arr[i] << " ";

    return 0;
}