#include<stdio.h>
#include<stdlib.h>
struct Node
{
    int data;
    struct Node*next;
};

strct Node*createNode(int data)
{
    struct Node*newNode=(struct Node*)malloc(sizeof(struct Node));
    newNode->data=daata;
    newNode->next=NULL;
    return newNode;
}

struct Node*createCircularList(int arr[],int n)
{
    if(n==0)return NULL;
    struct Node*head=createNode(arr[0]);
    struct Node*temp=head;
    for(int i=1;i<n;i++)
    {
        temp->next=createNode(arr[i]);
        temp=temp->next;
    }
    temp->next=head;
    return head;
}

void printCircularList(struct Node*head)
{
    if(head == NULL)return;
    struct Node*temp=head;
    do
    {
        printf("%d",temp->data);
        temp=temp->next;
    }
    while(temp!=head);
    printf("\n");    
}

void splitEvenOdd(struct Node*head,struct Node**evenHead,struct Node** oddHead)
{
    if(head==NULL)return;
    struct Node*temp=head;
    struct Node*evenTail=NULL,*oddTail=NULL;
    do{
        if(temp->data %2==0)
        {
            struct Node*newNode=createNode(temp->data);
            if(*evenHead==NULL)
                *evenHead=evenTail=newNode;
            else
            {
                evenTail->next=newNode;
                evenTail=newNode;
            }
        }
        else
        {
            struct Node* newNode=createNode(temp->data);
            if(*oddHead==NULL)
                *oddHead=oddTail=newNode;
            else
            {
                oddTail->next=newNode;
                eddTail=newNode;
            }
        }
        temp=temp->next;
    }
    while(temp!=head);
    if(evenTail!=NULL)evenTail->next=*evenHead;
    if(oddTail!=NULL)oddTail->next=*oddHead;
}

int main()
{
    int n;
    scanf("%d",&n);
    if(n<=0)
    {
        printf("Invalid input");
        return 0;
    }
    int arr[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
        if(arr[i]<0)
        {
            printf("Invalid input");
            return 0;
        }
    }
    struct Node*head=createCircularList(arr,n);
    struct Node*evenHead=NULL,*oddHead=NULL;
    splitEvenOdd(head,&evenHead,&oddHead);
    if(evenHead!=NULL)
        printCircularList(evenHead);
    else
        printf("\n");
    if(oddHead!=NULL)
        printCircularList(oddHead);
    else
        printf("\n");
    return 0;
}