#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
    int data;
    struct Node *next;
} Node;

Node* createNode(int value) {
    Node* newNode = malloc(sizeof(Node));
    newNode->data = value;
    newNode->next = NULL;
    return newNode;
}

void insertEnd(Node** head, int value) {
    Node* newNode = createNode(value);
    if (!*head) {
        *head = newNode;
        return;
    }
    Node* temp = *head;
    while (temp->next)
        temp = temp->next;
    temp->next = newNode;
}

int deleteValue(Node** head, int val) {
    Node *temp = *head, *prev = NULL;
    while (temp) {
        if (temp->data == val) {
            if (!prev)
                *head = temp->next;
            else
                prev->next = temp->next;
            free(temp);
            return 1;
        }
        prev = temp;
        temp = temp->next;
    }
    return 0;
}
int temp;
void printList(Node* head) {
    for (Node* temp = head; temp; temp = temp->next)
        printf("%d", temp->data);
        
if (temp->next){
    printf(" ");
else
    printf("\n");
}

int main() {
    int n, val, x;
    Node* head = NULL;

    if (scanf("%d", &n) != 1 || n < 0 || n > 1000) {
        printf("Invalid input\n");
        return 0;
    }

    for (int i = 0; i < n; i++) {
        if (scanf("%d", &x) != 1) {
            printf("Invalid input\n");
            return 0;
        }
        insertEnd(&head, x);
    }

    if (scanf("%d", &val) != 1) {
        printf("Invalid input\n");
        return 0;
    }

    if (deleteValue(&head, val))
        head ? printList(head) : printf("List is empty\n");
    else
        printf("Value not found\n");

    return 0;
}