#include <fstream>

using namespace std;

 ifstream x ("algsort.in");
 ofstream y ("algsort.out");

 struct node
 {
     int data;
     node *parent;
     node *left;
     node *right;
 };

 node *head;
 node *current;
 node *temp;

 void treepass(node *current)
 {
     if(current->left)
        treepass(current->left);
     y<<current->data<<' ';
     if(current->right)
        treepass(current->right);
 }

int main()
{
    int a;

    x>>a;

    head=new node();

    head->data=a;
    head->parent=NULL;
    head->left=NULL;
    head->right=NULL;

    current=head;

    while(x>>a)
    {
        temp=new node();

        current=head;

        while(current)
        {
            temp=current;

            if(a<current->data)
               current=current->left;
            else
               current=current->right;
        }

        current=new node();

        current->data=a;
        current->parent=temp;
        current->left=NULL;
        current->right=NULL;

        if(a<temp->data)
           temp->left=current;
        else
           temp->right=current;
    }
/*
    current=head;

    while(current)
    {
        y<<current->data<<' ';

        current=current->right;
    }
*/

    treepass(head);

    return 0;
}