#include <stdio.h>
#include <stdlib.h>

typedef struct node{
    int data;
    struct node *left, *right;
    
}node;
struct node* createnode(int data){
    struct node* node=(struct node*)malloc(sizeof(struct node));
    node->data= data;
    node->left=node->right=NULL;
    return node;
}

struct node* insertBST(struct node* root, int data) {
    if(root == NULL)
    return newnode(data);
    
    if(data < root->data)
    root->left=insertBST(root->left, data);
    else
    root->right=insertBST(root->right, data);
    
    return root;
    
}

void postOrderleaf(struct node* root){
    if(root==NULL)
    return;
    
    postOrderleaf(root->left);
    postOrderleaf(root->right);
    
    if(root->leaf==NULL && root->right == NULL)
    printf("%d ", rooy->data);

}

int main(){
    int n;
    scanf("%d", &n);
    
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    
    struct node* root=NULL;
    int data;
    
    for(int i=0;i<n;i++){
        scanf("%d", &data);
        
        
        root=insertBST(root, data);
    }
    postOrderleaf(root);
    return 0;
}