#include <iostream>
#include <algorithm>

using namespace std;

bool Compare(const int &a,const int &b){
	return a > b;//降序，前面的比后面大
}

int main(int argc, char const *argv[])
{
	int A[100]={0};
	while(cin>>A[0]>>A[1]>>A[2]>>A[3]>>A[4]>>A[5]>>A[6]>>A[7]>>A[8]>>A[9]){
	int i=0;
	int j=9;
	while(i<j){
		while(i<j && A[i]%2==1){i++;}
		while(i<j && A[j]%2==0){j--;}
		swap(A[i],A[j]);
		i++;
		j--;
	}
	sort(A,A+(i+j)/2,Compare);
	sort(A+(i+j)/2,A+10);
	for (int i = 0; i < 10; ++i)
	{
		printf("%d ",A[i]);
	}
	printf("\n");
}
	return 0;
}