import java.io.BufferedReader;

import java.io.IOException;
import java.io.InputStreamReader;
class SLL<E> {
    private SLLNode<E> first;

    public SLL() {
        // Construct an empty SLL
        this.first = null;
    }

    public void deleteList() {
        first = null;
    }

    public int length() {
        int ret;
        if (first != null) {
            SLLNode<E> tmp = first;
            ret = 1;
            while (tmp.succ != null) {
                tmp = tmp.succ;
                ret++;
            }
            return ret;
        } else
            return 0;

    }

    @Override
    public String toString() {
        String ret = new String();
        if (first != null) {
            SLLNode<E> tmp = first;
            ret += tmp + "->";
            while (tmp.succ != null) {
                tmp = tmp.succ;
                ret += tmp + "->";
            }
        } else
            ret = "Prazna lista!!!";
        return ret;
    }

    public void insertFirst(E o) {
        SLLNode<E> ins = new SLLNode<E>(o, first);
        first = ins;
    }
    public void setFirst(SLLNode<E>o) {
        first=o;
    }

    public void insertAfter(E o, SLLNode<E> node) {
        if (node != null) {
            SLLNode<E> ins = new SLLNode<E>(o, node.succ);
            node.succ = ins;
        } else {
            System.out.println("Dadenot jazol e null");
        }
    }

    public void insertBefore(E o, SLLNode<E> before) {

        if (first != null) {
            SLLNode<E> tmp = first;
            if(first==before){
                this.insertFirst(o);
                return;
            }
            //ako first!=before
            while (tmp.succ != before)
                tmp = tmp.succ;
            if (tmp.succ == before) {
                SLLNode<E> ins = new SLLNode<E>(o, before);
                tmp.succ = ins;
            } else {
                System.out.println("Elementot ne postoi vo listata");
            }
        } else {
            System.out.println("Listata e prazna");
        }
    }

    public void insertLast(E o) {
        if (first != null) {
            SLLNode<E> tmp = first;
            while (tmp.succ != null)
                tmp = tmp.succ;
            SLLNode<E> ins = new SLLNode<E>(o, null);
            tmp.succ = ins;
        } else {
            insertFirst(o);
        }
    }

    public E deleteFirst() {
        if (first != null) {
            SLLNode<E> tmp = first;
            first = first.succ;
            return tmp.element;
        } else {
            System.out.println("Listata e prazna");
            return null;
        }
    }

    public E delete(SLLNode<E> node) {
        if (first != null) {
            SLLNode<E> tmp = first;
            if(first ==node){
                return this.deleteFirst();
            }
            while (tmp.succ != node && tmp.succ.succ != null)
                tmp = tmp.succ;
            if (tmp.succ == node) {
                tmp.succ = tmp.succ.succ;
                return node.element;
            } else {
                System.out.println("Elementot ne postoi vo listata");
                return null;
            }
        } else {
            System.out.println("Listata e prazna");
            return null;
        }

    }

    public SLLNode<E> getFirst() {
        return first;
    }

    public SLLNode<E> find(E o) {
        if (first != null) {
            SLLNode<E> tmp = first;
            while (tmp.element != o && tmp.succ != null)
                tmp = tmp.succ;
            if (tmp.element == o) {
                return tmp;
            } else {
                System.out.println("Elementot ne postoi vo listata");
            }
        } else {
            System.out.println("Listata e prazna");
        }
        return first;
    }


    public void mirror(){
        if (first != null) {
            //m=nextsucc, p=tmp,q=next
            SLLNode<E> tmp = first;
            SLLNode<E> newsucc = null;
            SLLNode<E> next;

            while(tmp != null){
                next = tmp.succ;
                tmp.succ = newsucc;
                newsucc = tmp;
                tmp = next;
            }
            first = newsucc;
        }

    }

    public void merge (SLL<E> in){
        if (first != null) {
            SLLNode<E> tmp = first;
            while(tmp.succ != null)
                tmp = tmp.succ;
            tmp.succ = in.getFirst();
        }
        else{
            first = in.getFirst();
        }
    }
}
class SLLNode<E> {
    protected E element;
    protected SLLNode<E> succ;

    public SLLNode(E elem, SLLNode<E> succ) {
        this.element = elem;
        this.succ = succ;
    }

    @Override
    public String toString() {
        return element.toString();
    }
}

class par_nep_istoresnie {

    public static void razdeli_po_parnost(SLL<Integer>lista,int x) {

        SLLNode<Integer>dvizi=null;
        SLLNode<Integer>n=null;
        SLLNode<Integer>p=null;
        SLL<Integer>parna=null;
        SLL<Integer>neparna=null;

        dvizi=lista.getFirst();

        //ILI VO IF KE VLEZE ILI VO ELSE NE VO DVETE!!
        if(dvizi.element<x) {
            //znaci prviot element e paren  SLUCAJ 1
            parna=lista;
            p=parna.getFirst();
            neparna=new SLL<>();

            while(dvizi.succ!=null) {
                dvizi=dvizi.succ;
                if(dvizi.element<x) {
                    //paren element e nareden
                    p.succ=dvizi;
                    p=dvizi;
                }else {
                    //neparen element e nareden
                    if(n==null) {
                        //neparna ne postoi
                        neparna.setFirst(dvizi);
                        n=dvizi;
                    }else {
                        //ima veke ele vo neparna
                        n.succ=dvizi;
                        n=dvizi;
                    }

                }

            }
            //si dosol do kraj

        }else {
            //prviot element e neparen    SLUCAJ 2
            neparna=lista;
            n=neparna.getFirst();
            parna=new SLL<>();
            //ako prviot e neparen
            while(dvizi.succ!=null) {
                dvizi=dvizi.succ;
                if(dvizi.element>=0) {
                    //aako sl el e neparen
                    n.succ=dvizi;
                    n=dvizi;

                }else {
                    //ako sl el e paren
                    //treba da proverime dali parna posto i
                    if(p==null) {
                        //ne postoi
                        parna.setFirst(dvizi);
                        p=dvizi;
                    }else {
                        //postoi
                        p.succ=dvizi;
                        p=dvizi;
                    }
                }
            }
            //znaci sme stignale do kraj
            //MORALNO POK NA NULL


        }
        SLLNode<Integer> nodeS = parna.getFirst();

        while(nodeS!=null){
            if(nodeS.succ==null){
                System.out.print(nodeS.element);
            }else{
                System.out.print(nodeS.element+"->");
            }

            nodeS = nodeS.succ;

        }
        SLLNode<Integer> nodeB = neparna.getFirst();

        while(nodeB!=null){
            if(nodeB.succ==null){
                System.out.print(nodeB.element);
            }else{
                System.out.print(nodeB.element+"->");
            }

            nodeB = nodeB.succ;
        }
    }

    public static void main(String[] args) throws  IOException {
        BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));

        int N=Integer.parseInt(bf.readLine());

        String []niza=bf.readLine().split(" ");

        SLL<Integer>lista=new SLL<>();

        for(int i=0;i<N;i++) {
            lista.insertLast(Integer.parseInt(niza[i]));
        }
        int x=Integer.parseInt(bf.readLine());
        razdeli_po_parnost(lista,x);


    }

}