#include "iostream"
#include "cstring"
#include "string"
#include "algorithm"
#include "cstdio"
using namespace std;

struct Node
{
    int Num;
    Node * Next;
};
Node *Head;
Node *tmp; 
Node *p;
Node *tail;

void Init(){
    Head = (Node *)malloc(sizeof(Node));
    Head->Next = NULL;
    Head->Num = 0;
    tail = (Node *)malloc(sizeof(Node));//這句話是多余的，因為在執行tail=Head時tail的地址=Head的地址;
    tail = Head;
}

void Build(int n)
{
    tmp = (Node *)malloc(sizeof(Node));
    tmp->Num = n;
    tmp->Next = NULL;
    tail->Next = tmp;
    tail = tail->Next;
}

void Delete(int n){
    if(Head->Next==NULL) return;
    p = Head;
    while(p->Next->Num!=n && p->Next->Next!=NULL){
        p = p->Next;
    }
    if(p->Next->Num==n){
        if(p->Next->Next==NULL){
            tail = p;
        }
        p->Next=p->Next->Next;
        cout<<"Successfully Delete!"<<endl;
        cout<<"After Deleting:";
    }
    else{
        cout<<"Not Found!"<<endl;
        cout<<"After Deleting:";
    }
}

void Print(){
    p = Head->Next;
    if(p==NULL){
        cout<<"Empty!"<<endl;
        return;
    }
    while(p!=NULL){
        cout<<p->Num<<" ";
        p = p->Next;
    }
    cout<<endl;
}

int main()
{
    int a;
    Init();
    while(cin>>a && a){
        Build(a);
    }
    Print();
    while(cin>>a && a){
        Delete(a);
        Print();
    }
    if(Head->Next==NULL){
        Head = tail;
    }
    while(cin>>a && a){
        Build(a);
    }
    cout<<"After Adding:";
    Print();
}