#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node* left;
    struct node*right;
}node;
node*createnode(int value){
    node*newnode=(node*)malloc(sizeof(node));
    newnode->data=value;
    newnode->left=NULL;
    return newnode;
}
node*insert(node*root,int value){
    if(root==NULL)
    return
    createnode(value);
    if(value<root->data)
    root->left=insert(root->left,value);
    else
    root->right=insert(root->right,value);
    return root;
}
void postOrderLeafnode(node*root){
if(root==NULL)
return;
postOrderLeafnode(root->left);
postOrderLeafnode(root->right);
if(root->lrft==NULL && root->right==NULL)
printf("%d",root->data);
}
int main(){
    int n,value;
    scanf("%d",&n);
    node*root=NULL;
    for(int i0;i<n;i++){
        scanf("%d",&value);
        root=insert(root,value);
    }
    postOrderLeafnode(root);
    printf(" ");
    return 0;
}