/*
TASK:books
LANG:C++
*/ 
#include<iostream>
using namespace std;
typedef struct{
	int nn;
	int fn;
	int sc;
	int ch;
}book;
int main(){
	book k[31],k2[31];
	int rez[31];
	int n,min=6562;
	int a,b,c,d,i,j,s,h;
	cin>>n;
	for(i=1;i<=n;i++){
		cin>>k[i].nn;}
	if(k[i].nn<=99){
	b=k[i].nn%10;
	a=k[i].nn/10%10;
	if((a+b)%2==0){k[i].ch=1;k[i].sc=a*b;j++;}
	else {k[i].ch=0;k[i].sc=a*b;h++;}}
	else if(k[i].nn<=999){
	c=k[i].nn%10;
	b=k[i].nn/10%10;
	a=k[i].nn/100%10;
	if((a+b+c)%2==0){k[i].ch=1;k[i].sc=a*b*c;j++;}
	else {k[i].ch=0;k[i].sc=a*b*c;h++;}}
	else if(k[i].nn<=2000){
	d=k[i].nn%10;
	c=k[i].nn/10%10;
	b=k[i].nn/100%10;
	a=k[i].nn/1000%10;
	if((a+b+c)%2==0){k[i].ch=1;k[i].sc=a*b*c*d;j++;}
	else {k[i].ch=0;k[i].sc=a*b*c*d;h++;}}
	for(i=1;i<=n;i++)
	{
		if(k[i].sc<k[i+1].sc){s=k[i].sc;k[i].sc=k[i+1].sc;k[i+1].sc=s;}
	}
	for(i=1;i<=n;i++){if(k[i].sc<k[i+1].sc)k2[i].fn=k[i+1].nn;else k2[i].fn=k[i].nn;}
	for(i=1;i<=n;i++)
	{
		if(k2[i].ch==1)cout<<k2[i].fn<<' ';
	}
	for(i=1;i<=n;i++)
	{
		if(k2[i].ch!=1)cout<<k2[i].fn<<' ';
	}
	cout<<endl;
	return 0;
}
