#include<iostream> #include<algorithm> using namespace std; int cmp(int a,int b){ return a>b; } int main() { int n,a[15],b[15],cnt1=0,cnt2=0; for(int i=0;i<10;i++){ cin>>n; if(n%2==1) a[cnt1++]=n; else b[cnt2++]=n; } sort(a,a+cnt,cmp); sort(b,b+cnt); for(int i=0;i<cnt1;i++){ cout<<a[i]<<" "; } for(int i=0;i<cnt2;i++){ cout<<b[i]<<" "; } return 0 }