#include <bits/stdc++.h>
using namespace std;

struct node{
    int val;
    node* left;
    node* right;
};

void Insert(node* &root,int t,int father){
    if (root==nullptr){
        root=new node{t,nullptr,nullptr};
        cout<<father<<endl;
    }
    else if(t>=root->val){
        Insert(root->right,t,root->val);
    }
    else if(t<root->val){
        Insert(root->left,t,root->val);
    }
}

int main(){
    int N;
    cin>>N;
    node* tree=nullptr;
    for(int i=0;i<N;i++){
        int t;
        cin>>t;
        Insert(tree,t,-1);
    }
}