dynamic_2

#include <iostream>
#include <algorithm>
#include <stdio.h>

using namespace std;

struct stack{
    int inf;
    stack* next;
};

stack *init(){
    return NULL;
}

void push(stack *&h, int x){
    stack *top = new stack();
    top->inf = x;
    top->next = h;
    h = top;
}

int top(stack *&h){
    return h->inf;
}

int pop(stack *&h){
    int i = h->inf;
    stack *cur = h;
    h=h->next;
    delete cur;
    return i;
}

int main()
{
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int n;
    scanf("%d", &n);

    stack *a = init();
    stack *odd = init();
    stack *even = init();

    for(int i = 0; i < n; i++){
        int cur; scanf("%d", &cur);
        if(cur % 2) push(odd, cur);
        else push(even, cur);
    }
    while(odd)
        push(a, pop(odd));

    while(even)
        push(a, pop(even));

    while(a)
        printf("%d ", pop(a));

    return 0;
}