// editor1

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

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

typedef struct List{
    Node *head, *tail;
}List;

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

Node *addNodeEnd(Node *head, int data){
    if(head==NULL)return createNode(data);
        
    head->next=addNodeEnd(head->next, data);
    head->next->prev=head;
    return head;
}

Node *addNodeStart(Node *head, int data){
    if(head==NULL)return createNode(data);
    
    head->prev=addNodeStart(head->prev, data);
    head->prev->next=head;
    return head->prev;
}

void printList(Node *head){
    if(head==NULL)return;
    printf("%d ", head->data);
    printList(head->next);
}

Node *findTail(Node *head){
    if(head==NULL||head->next==NULL)return head;
    return findTail(head->next);
}

void printListRev(Node *tail){
    if(tail==NULL)return;
    printf("%d ", tail->data);
    printListRev(tail->prev);
}

Node *findNode(Node *head, int data){
    if(head->data==data)return head;
    if(head->next!=NULL)
    return findNode(head->next);
    else return NULL;
}

int main(){
    int n, data;
    scanf("%d ", &n);
    if(n<0){
        printf("Invalid input");
        return 0;
    }
    Node *head=NULL;
    for(int i=0;i<n;i++){
        scanf("%d", &data);
        head = addNodeEnd(head, data);
    }
    printList(head);
    if(findNode(head, 700))printf("Found");
    else printf("Not Found");
    return 0;
}