//数组顺序调整,奇数位于偶数前,没有要求相对位置不变
#include <stdio.h>
int main()
{
int i, j, k, n, t ,arr[100000];
bool first;
while (scanf("%d", &n) != EOF)
{
first = true;
k = 0;
for (i = 0; i < n; i++)
{
scanf("%d", &t);
if (t & 1)
{
if (first)
{
printf("%d", t);
first = false;
}
else
printf(" %d", t);
}
else
arr[k++] = t;
}
for (int j = 0; j < k; j++)
printf(" %d", arr[j]);
}
puts("");
return 0;
}
#include <stdio.h>
int main()
{
int i, j, k, n, t ,arr[100000];
bool first;
while (scanf("%d", &n) != EOF)
{
first = true;
k = 0;
for (i = 0; i < n; i++)
{
scanf("%d", &t);
if (t & 1)
{
if (first)
{
printf("%d", t);
first = false;
}
else
printf(" %d", t);
}
else
arr[k++] = t;
}
for (int j = 0; j < k; j++)
printf(" %d", arr[j]);
}
puts("");
return 0;
}