#include<iostream>
#include<algorithm>
using namespace std;
class ee{
    public:
        void output(int a[],int n)
        {
            for(int i=0;i<n;i++) cout<<a[i]<<" ";
        }
        void o(int a[],int n)
        {
            for(int i=0;i<n;i++)
            {
                int j=a[i];
                if(j%2==0) cout<<a[i]<<" ";
            }
        }
    private:
}k;
int main()
{
    int n,j;cin>>n;
    int a[n];
    for(int i=0;i<n;i++) cin>>a[i];
    sort(a,a+n);
    k.output(a,n);
    printf("\n");
    k.o(a,n);
    system("pause");
    return 0;
}

#include <stdio.h>
const int N = 1005;
int main() {
    int n, temp;
    int a[N];
    while (scanf("%d", &n) == 1) {
        for (int i = 0; i < n; i++) {
            scanf("%d", &a[i]);
        }
        for (int i = 0; i < n - 1; i++) {
            for (int j = 0; j < n - i - 1; j++) {
                if (a[j] > a[j + 1]) {
                    temp = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = temp;
                }
            }
        }
        for (int i = 0; i < n; i++) {
            printf("%d%c", a[i], i == n - 1 ? '\n':' ');
        }
        for (int i = 0; i < n; i++) {
            if (a[i] % 2 == 0) {
                printf("%d ", a[i]);
            }
        }
        printf("\n");
    }
    return 0;
}