// editor5
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left,*right;
}Node;
Node *root=NULL;
Node *create(int num){
    Node*newNode=(Node*)malloc(1 *sizeof(Node));
    newNode->data=num;
    newNode->left=NULL;
    newNode->right=NULL;
    return newNode;
}
Node *insert(Node *root,int num){
    if(root==NULL){
        return create(num);
    }
    if(num<root->data){
        root->left=insert(root->left,num);
    }
    else if(num>root->data){
        root->right=insert(root->right,num);
    }
    return root;
}
void inOrder(Node *root){
    if(root!=NULL){
        inOrder(root->left);
        printf("%d ",root->data);
        inOrder(root->right);
    }
}
Node *search(Node *root,int num){
    if(root==NULL||root->data==num){
        return root;
    }
    if(num<root->data){
        return search(root->left,num);
    }
    return search(root->right,num);
}
Node *minimum(Node *data,int num){
    if(root==NULL){
        return root;
    }
    if(root->left!=NULL){
        return minimum(root->left);
    }
    return root;
}
int main(){
    int size,itr,num;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(itr=1;itr<=size;itr++){
        scanf("%d",&num);
        root=insert(root,num);
    }
    scanf("%d",&num);
    Node *ans=minimum(root,num);
    
    return 0;
}