#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;
}
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;
}

Node* maximum(Node *root){
    if(root==NULL)
    return root;
    else if(root->right!=NULL)
        return maximum(root->right);
    return root;
}
void inOrder(Node *root){
    if(root!=NULL){
    inOrder(root->left);
    printf("%d",root->data);
    inOrder(root->right);
    }
}
int main(){
    int num,size,itr;
    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);
    maximum(root->data);
    return 0;
}