import java.io.*;
import java.util.*;
 class Node{
      int data;
      Node left,right;
      Node(int data){
          this.data = data;
          left = right = null;
      }
}
//class LinkedList
//{
    //Node head....

//}
class BST{

    Node root;
    void addNodeFunction(int data){
        root = addNode(root,data);
    }


    Node addNode(Node currentNode,int data){

        if (currentNode == null) {
            currentNode = new Node(data);
            return currentNode;
        }

        //System.out.println(currentNode.data+" ");

        if (data < currentNode.data)
            currentNode.left = addNode(currentNode.left, data);
        else if (data > currentNode.data)
            currentNode.right = addNode(currentNode.right, data);


      return currentNode;
    }
    void preOrderFunction(){

        preOrderTraversal(root);
    }
    void preOrderTraversal(Node root){

        if(root==null){
            return;
        }
        System.out.print(root.data+" ");
        preOrderTraversal(root.left);
        preOrderTraversal(root.right);
    }

}
public class Main {

    public static void main(String args[]) {

        BST tree = new BST();
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        for(int i=0;i<n;i++){
            arr[i] = sc.nextInt();
        }
        for(int i=0;i<n;i++){

          int value = arr[i];
          tree.addNodeFunction(arr[i]);
        }


        tree.preOrderFunction();
    }
}