struct ListNode*reverse(struct ListNode*head){
    struct ListNode*prev = NULL;
    struct ListNode*current = head;
    struct ListNode*next = NULL;
    while(current!= NULL){
        next = current->next;
        current->next = prev;
        prev = current;
        current = next;
    }
    return prev;
}

#include <bits/stdc++.h>
#include<iostream>
using namespace std;

const int MAXSIZE = 20;
typedef int ElemType;

typedef struct arrList{
    ElemType *elem;
    int length;
}SqList;

void creatArrList(SqList*L){
    L->elem = (ElemType *)malloc(MAXSIZE*sizeof(ElemType));
    if(!L->elem){
    }
    L->length = 0;
}

void ListInsert(SqList * L ,int i,ElemType e){
    if(L->length == MAXSIZE){
    }
    if(i<1||i>L->length+1){
    }
    if(i<=L->length){
        for(int k = L->length;k>=i-1;k--){
            L->elem[k+1] = L->elem[k];
        }
    }
    L->elem[i-1]=e;
    L->length++;
}
void Output(SqList&L){
    for(int i = 0;i<L.length;i++){
      if(i!=L.length - 1){
          cout<<L.elem[i]<<",";
      }else{
          cout<<L.elem[i];
      }
    }
}
void mergeLists(SqList*La,SqList*Lb,ElemType*arr,int&totalLength){
    for(int i = 0;i<La->length;i++){
        arr[i]=La->elem[i];
    }
    for(int i = 0;i<Lb->length;i++){
        arr[La->length+i] = Lb->elem[i];
    }
    totalLength = La->length+Lb->length;
}
int main(){
    SqList La,Lb;
    creatArrList(&La);
    creatArrList(&Lb);
    while(true){
        int num;
        cin>>num;
        if(num== -1)break;
        ListInsert(&La,La.length+1,num);
    }
    int lena =La.length;
    while(true){
        int num;
        cin>>num;
        if(num==-1)break;
        ListInsert(&Lb,Lb.length+1,num);
    }
    int lenb = Lb.length;

    int arr[MAXSIZE*2]={0};
    int totalLength;
    mergeLists(&La,&Lb,arr,totalLength);
    sort(arr,arr+totalLength);
    bool allsame = true;
    for(int i = 1;i<totalLength;i++){
        if(arr[i]!=arr[0]){
            allsame = false;
            break;
        }
    }
    if(allsame){
        cout<<arr[0];
    }else{
    int temp = -1;
    for(int i = 0;i<totalLength;i++){
        if(temp!=arr[i]){
            cout<<arr[i];
            if(i<totalLength-1){
                cout<<",";
            }
            temp = arr[i];
        }
    }
    }
    free(La.elem);
    free(Lb.elem);
    
}

#include <bits/stdc++.h>

using namespace std;

// 节点结构
struct Node {
    int data;
    Node* prior;
    Node* next;
    
    Node(int value) : data(value), prior(nullptr), next(nullptr) {}
};

// 创建双向链表
Node* createList(const vector<int>& elements) {
    if (elements.empty()) return nullptr;

    Node* head = new Node(elements[0]);
    Node* current = head;
    for (int i = 1; i < elements.size(); i++) {
        current->next = new Node(elements[i]);
        current->next->prior = current;
        current = current->next;
    }
    // 形成循环
    current->next = head;
    head->prior = current;
    return head;
}

// 打印
void printList(Node* head) {
    if (!head) return;
    Node* current = head;
    do {
        cout << current->data;
        current = current->next;
    } while (current != head);
    cout << endl;
}
// 交换p节点与其前驱节点
void swap(Node* p) {
    if (!p || !p->prior) return;
    Node* previous = p->prior;
    
    // 数据交换
    swap(p->data, previous->data);

    // // 连接交换
    // Node* pNext = p->next;
    // Node* prevNext = previous->next;

    // // 调整指针
    // if (prevNext != p) {
    //     previous->next = pNext;
    //     p->next = prevNext;

    //     if (pNext) pNext->prior = previous;
    //     if (prevNext) prevNext->prior = p;
    // }

    // // 调整前驱指针
    // previous->prior = p;
    // p->prior = previous->prior;
}

// 释放内存
void freeList(Node* head) {
    if (!head) return;
    Node* current = head;
    do {
        Node* toDelete = current;
        current = current->next;
        delete toDelete;
    } while (current != head);
}

int main() {
    int n;
    cin >> n;
    vector<int> elements(n);
    for (int& elem : elements) { 
        cin >> elem;
    }
    int num;
    cin >> num;

    Node* head = createList(elements);
    Node* current = head;
    bool found = false;

    // 遍历寻找目标
    do {
        if (current->data == num) {
            swap(current);
            found = true;
            break;
        }
        current = current->next; 
    } while (current != head);

    if (found) {
        printList(head);
    } else {
        cout << "未找到" << num << endl;
    }

    // 释放内存
    freeList(head);
    
    return 0;
}