import java.io.*;
import java.util.*;

class DLLNode<E> {
    protected E element;
    protected DLLNode<E> pred, succ;

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

    @Override
    public String toString() {
        return element.toString();
    }
}
class DLL<E> {
    private DLLNode<E> first, last;

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

    public void deleteList() {
        first = null;
        last = null;
    }

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

    }

    public DLLNode<E> find(E o) {
        if (first != null) {
            DLLNode<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 insertFirst(E o) {
        DLLNode<E> ins = new DLLNode<E>(o, null, first);
        if (first == null)
            last = ins;
        else
            first.pred = ins;
        first = ins;
    }

    public void insertLast(E o) {
        if (first == null)
            insertFirst(o);
        else {
            DLLNode<E> ins = new DLLNode<E>(o, last, null);
            last.succ = ins;
            last = ins;
        }
    }

    public void insertAfter(E o, DLLNode<E> after) {
        if(after==last){
            insertLast(o);
            return;
        }
        DLLNode<E> ins = new DLLNode<E>(o, after, after.succ);
        after.succ.pred = ins;
        after.succ = ins;
    }

    public void insertBefore(E o, DLLNode<E> before) {
        if(before == first){
            insertFirst(o);
            return;
        }
        DLLNode<E> ins = new DLLNode<E>(o, before.pred, before);
        before.pred.succ = ins;
        before.pred = ins;
    }

    public E deleteFirst() {
        if (first != null) {
            DLLNode<E> tmp = first;
            first = first.succ;
            if (first != null) first.pred = null;
            if (first == null)
                last = null;
            return tmp.element;
        } else
            return null;
    }

    public E deleteLast() {
        if (first != null) {
            if (first.succ == null)
                return deleteFirst();
            else {
                DLLNode<E> tmp = last;
                last = last.pred;
                last.succ = null;
                return tmp.element;
            }
        }
        // else throw Exception
        return null;
    }

    public E delete(DLLNode<E> node) {
        if(node==first){
            deleteFirst();
            return node.element;
        }
        if(node==last){
            deleteLast();
            return node.element;
        }
        node.pred.succ = node.succ;
        node.succ.pred = node.pred;
        return node.element;

    }

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

    public String toStringR() {
        String ret = new String();
        if (last != null) {
            DLLNode<E> tmp = last;
            ret += tmp + "<->";
            while (tmp.pred != null) {
                tmp = tmp.pred;
                ret += tmp + "<->";
            }
        } else
            ret = "Prazna lista!!!";
        return ret;
    }

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

    public DLLNode<E> getLast() {

        return last;
    }

    public void setFirst(DLLNode<E> first) {
        this.first = first;
    }

    public void setLast(DLLNode<E> last) {
        this.last = last;
    }


}

public class DLLVojska
{

    public static DLL<Integer> vojska(DLL<Integer> lista ,int a,int b,int c,int d)
    {
        DLLNode<Integer> A = null;
        DLLNode<Integer> B = null;
        DLLNode<Integer> C = null;
        DLLNode<Integer> D = null;

        DLLNode<Integer> dvizi = lista.getFirst();

        while(dvizi!=null)
        {
            if(dvizi.element.equals(a))
            {
                A = dvizi;
            }
            if(dvizi.element.equals(b))
            {
                B = dvizi;
            }
            if(dvizi.element.equals(c))
            {
                C = dvizi;
            }
            if(dvizi.element.equals(d))
            {
                D = dvizi;
            }
            dvizi = dvizi.succ;
        }
        DLLNode<Integer> pomA = A.pred;
        DLLNode<Integer> pomB = B.succ;
        DLLNode<Integer> pomC = C.pred;
        DLLNode<Integer> pomD = D.succ;


        B.succ = pomD;

        if(pomD!=null)
        {
            pomD.pred = B;
        }
        else
        {
            lista.setLast(B);
        }

        if(pomA!=null)
        {
            C.pred = pomA;
            pomA.succ = C;
        }
        else
        {
            lista.setFirst(C);
        }

        if(pomB!=C)
        {
            D.succ = pomB;
            pomB.pred = D;
        }
        else
        {
            D.succ = A;
            A.pred  = D;
        }
        if(pomC!=B)
        {
            pomC.succ = A;
            A.pred = pomC;
        }
        return lista;

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


        DLL<Integer> lista = new DLL();
        int N = Integer.parseInt(br.readLine());
        String line = br.readLine();
        String []pomNiza = line.split(" ");
        for (int i = 0; i < N; i++) {
            lista.insertLast(Integer.parseInt(pomNiza[i]));
        }
        line = br.readLine();
        pomNiza = line.split(" ");
        int a = Integer.parseInt(pomNiza[0]);
        int b = Integer.parseInt(pomNiza[1]);
        line = br.readLine();
        pomNiza = line.split(" ");
        int c = Integer.parseInt(pomNiza[0]);
        int d = Integer.parseInt(pomNiza[1]);

        DLL<Integer> result = vojska(lista,a,b,c,d);
        System.out.println(result);

    }
}