#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);
    if(num > root->data)
    root->right=insert(root->right,num);
    returnroot;
}
void inorder(Node *root)
{
    if(root!=NULL)
    {
        inorder(root->left);
        if(root->left==NULL && root->right==NULL)
        {
            printf("%d ",root->data);
        }
        inorder(root->right);
    }
}
int main()
{
    int i,n,num;
    scanf("%d",&n);
    if(n<=0)
    {
        ptintf("Invalid input");
        return 0;
    }
    for(i=0;i<n;i++)
    {
        scanf("%d",&num);
        root=insert(root,num);
    }
    inorder(root);
    return 0;
}