#include<stdio.h>
int n,a[1005],ji[1005],ou[1005];
//核心在排序上面，使用的冒泡排序
void sort(int *arr,int size){
	for(int i = 0;i<size;i++){
		for(int j = 0;j<size-1-i;j++){
			if(arr[j] > arr[j+1]){
				int temp;
				temp = arr[j+1];
				arr[j+1] = arr[j];
				arr[j] = temp;
			}
		}
	}
}
int main() 
{ 

	scanf("%d",&n);
	int j = 0,o = 0;
	for(int i = 0;i < n; i++){
		scanf("%d",&a[i]);
		if(a[i]%2==0){
			
			ou[o] = a[i];
			o++;
		}else{
			
			ji[j] = a[i];
			j++;
		}
	}
	sort(ji,j);
	sort(ou,o);
	for(int l = 0;l<o;l++){
		printf("%d",ji[l]);
		if(l != o){
			printf(" ");
		}
	}
	for(int p = 0;p<j;p++){
		printf("%d",ou[p]);
		if(p != j){
		printf(" ");
		}
	}
	 
	
}