#include <iostream>
using namespace std;
const int MAX_SIZE = 100;
struct Queue {
    int a[MAX_SIZE];
    int S, E;

    void init() {
        S = 0;
        E = -1;
    }

    bool isFull() {
        if(E == MAX_SIZE - 1) {
            return true;
        }
        else {
            return false;
        }
    }

    bool isEmpty() {
        if(E == -1) {
            return true;
        }
        else {
            return false;
        }
    }

    void push(int x) {
        if(isFull()) {
            cout << "queue overflow" << endl;
            exit(-1);
        }
        E++;
        a[E] = x;
    }

    int front() {
        if(isEmpty()) {
            cout << "prazen red" << endl;
            exit(-1);
        }
        return a[S];
    }

    int pop() {
        if(isEmpty()) {
            cout << "prazen red" << endl;
            exit(-1);
        }

        int x = a[S];

        for(int i = 0; i < E; i++) {
            a[i] = a[i + 1];
        }
        E--;

        return x;
    }


};

struct node {
    int info;
    node *next;
};

struct SinglyLinkedList {
    node * head;

    void init() {
        head = NULL;
    }

    void insertFront(int x) {
        node * new_node = new node;
        new_node->info = x;
        new_node->next = NULL;

        if(head == NULL) {
            head = new_node;
        }
        else {
            new_node->next = head;
            head = new_node;
        }
    }


    void insertBack(int x) {
        node * new_node = new node;
        new_node->info = x;
        new_node->next = NULL;

        if(head == NULL) {
            head = new_node;
        }
        else {
            node * tmp = head;
            while(tmp->next != NULL) {
                tmp = tmp->next;
            }
            tmp->next = new_node;
        }
    }

    void deleteFront() {
        if(head != NULL) {
            if(head->next == NULL) {
                delete head;
                head = NULL;
            }
            else {
                node * tmp = head;
                head = head->next;
                delete tmp;
            }
        }
    }

    void deleteBack() {
        if(head != NULL) {
            if(head->next == NULL) {
                delete head;
                head = NULL;
            }
            else {
                node * tmp = head;
                while(tmp->next->next != NULL) {
                    tmp = tmp->next;
                }
                delete tmp->next;
                tmp->next = NULL;
            }
        }
    }

    void deleteAll() {
        while(head != NULL) {
            deleteFront();
        }
    }

    void deleteNode(int x) {
        if(head != NULL) {
            if(head->info == x) {
                deleteFront();
            }
            else {
                node * tmp = head;
                node * prev = NULL;

                while(tmp != NULL && tmp->info != x) {
                    prev = tmp;
                    tmp = tmp->next;
                }

                prev->next = tmp->next;
                delete tmp;
            }
        }
    }

    void deleteNode(node * x) {
        if(head != NULL) {
            if(head == x) {
                deleteFront();
            }
            else {
                node * tmp = head;
                node * prev = NULL;

                while(tmp != NULL && tmp != x) {
                    prev = tmp;
                    tmp = tmp->next;
                }

                prev->next = tmp->next;
                delete tmp;
            }
        }
    }

    void print() {
        node * tmp = head;
        while(tmp != NULL) {
            cout << tmp->info << " --> ";
            tmp = tmp->next;
        }
        cout << endl;
    }


};

void funkcija(Queue & red, SinglyLinkedList & sl1, SinglyLinkedList & sl2) {
    while(red.isEmpty() == false) {
        int x = red.front();
        red.pop();

        int brojac = 1;
        while(red.isEmpty() == false && red.front() == x) {
            red.pop();
            brojac++;
        }

        if(brojac == 1) {
            sl1.insertBack(x);
        }
        else {
            for(int i = 0; i < brojac - 1; i++) {
                sl2.insertBack(x);
            }
            sl1.insertBack(x);
        }

    }

    sl1.print();
    sl2.print();
}

 int main() {
     SinglyLinkedList sl1, sl2;
     sl1.init();

     Queue red;
     red.init();
     int n;
     cin >> n;
     for(int i = 0; i < n; i++) {
         int x;
         cin >> x;
         red.push(x);
     }

     sl2.init();


     funkcija(red, sl1, sl2);
    return 0;
}
/*
 18
 113  83  83  119  85  85  101  67  67  67  114  69  69  116  83  83  83  121

 **/