#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(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
void *insert(Node *root,int num){
    if(root==NULL)
    return create(num);
    if(num >root->data)
    root->right=insert(root->right,num);
    else if(num < root->data)
    root->left=insert(root->left,num);
    return root;
}
void *inorder(Node *root){
    if(root!=NULL){
        inorder(root->left);
        printf("%d",root->data);
        inorder(root->right);
    }
}
Node *maximum(Node *root){
    if(root==NULL)
        return root;
    if(root->right!=NULL)
      return maximum(root->right);
     return root;
}
int main(){
   int itr,num,size;
   scanf("%d",&size);
   if(size<0){
       printf("Invalid input");
       return 0;
   }
   for(itr=1;itr<=size;itr++){
       scanf("%d",&num);
       root=insert(root,num);
   }
   inorder(root);
   rmaximum(root);
   return 0;
}