#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node*left;
    struct node*right;
}node;
node*root=NULL;
node*create(int num){
    node*newnode=(node*)malloc(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 maximum(node*root){
    if(root == NULL){
        printf("Empty");
        return ;
    }
    while(root->right!=NULL){
    root=root->right;
    printf("%d ",node->data);
    }
}
int main(){
    node*root=NULL;
    int size,i,num;
    scanf("%d ",&size);
    if(size<=0){
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<=size;i++){
        scanf("%d ",&num);
        root=insert(root,num);
        
    }
    maximum(root);
    return 0;
}