#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    vector<int> even, odd, necklace;
    int num;

    for (int i = 0; i < 10; i++) {
        cin >> num;
        if (num % 2 == 0) even.push_back(num);
        else odd.push_back(num);
    }

    sort(even.begin(), even.end());
    sort(odd.begin(), odd.end(), greater<int>());

    necklace.insert(necklace.end(), odd.begin(), odd.end());
    necklace.insert(necklace.end(), even.begin(), even.end());

    for (int i =