/*银行业务队列简单模拟*/
#include<iostream>
using namespace std;
#define Maxsize 1000;

typedef int *ElmementType;
typedef int Position;
struct QNode
{
	ElmementType Data;
	Position front;
	Position rear;
	int maxsize;
	int count;
};
typedef struct QNode* Queue;

void CreateQueue(Queue &Q);
bool EnQueue(Queue& Q, int X);
int DeQueue(Queue& Q);
void BusinessProcess(Queue AQue, Queue BQue);
int main()
{
	Queue Aqueue;
	Queue Bqueue;
	CreateQueue(Aqueue);
	CreateQueue(Bqueue);
	int gross;/*gross means total content*/
	cin >> gross;
	int* numbers = new int[gross];
	for (int i = 0; i < gross; i++)
	{
		cin >> numbers[i];
		if (numbers[i] % 2 != 0)
		{
			EnQueue(Aqueue, numbers[i]);
		}
		else
		{
			EnQueue(Bqueue, numbers[i]);
		}
	}
	BusinessProcess(Aqueue, Bqueue);

	delete Aqueue;
	delete Bqueue;
}

void CreateQueue(Queue &Q)
{
    Q = new struct QNode;
	Q->maxsize = Maxsize;
    Q->Data = new int[Q->maxsize];
    Q->front = 0;
    Q->rear = 0;
	Q->count = 0;
	
}
bool EnQueue(Queue& Q, int X)
{
	if (Q->rear == Q->maxsize)
	{
		return false;
	}
	Q->Data[Q->rear++] = X;
	Q->count++;
	return true;
}

int DeQueue(Queue& Q)
{
	int delData;
	if (Q->rear == Q->front)
	{
		return false;
	}
	delData = Q->Data[Q->front++];
	Q->count--;
	return delData;
}

void BusinessProcess(Queue AQue, Queue BQue)
{
	while (AQue->count && BQue->count)
	{
		cout << DeQueue(AQue) << " ";
		if (AQue->count != 0)
		{
			cout << DeQueue(AQue) << " ";
		}
		/*the last output*/
		if (AQue->count == 0 && BQue->count == 1)
		{
			cout << DeQueue(BQue);
		}
		else
		{
			cout << DeQueue(BQue) << " ";
		}
	}

	while (AQue->count)
	{
		if (AQue->count == 1)
		{
			cout << DeQueue(AQue);
		}
		if (AQue->count != 0)
		{
			cout << DeQueue(AQue) << " ";
		}
		
	}

	while (BQue->count)
	{
		if (BQue->count == 1)
		{
			cout << DeQueue(BQue);
		}
		if (BQue->count != 0)
		{
			cout << DeQueue(BQue) << " ";
		}
	}
}