http://noi.openjudge.cn/ch0110/06/
"""
1.10 编程基础之简单排序 06 整数奇偶排序
http://noi.openjudge.cn/ch0110/06/
"""
a=list(map(int,input().split()))
lena=len(a)
ans01=[]
ans02=[]
i=0
while i<lena:
if a[i]%2==0:
ans01.extend([int(a[i])])
else:
ans02.extend([int(a[i])])
i+=1
ans01.sort()
ans02.sort()
#print(ans01)
#print(ans02)
j=len(ans02)-1
while j>=0:
print("%d" %ans02[j],end=" ")
j-=1
k=0
while k<len(ans01):
print("%d" %ans01[k],end=" ")
k+=1