#include<iostream>
#include<fstream>

std::ifstream fin("algsort.in");
std::ofstream fout("algsort.out");

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

BSTnode* getNode(int x) {
    BSTnode* newNode = new BSTnode;
    newNode->val = x;
    newNode->left = NULL;
    newNode->right = NULL;
    return newNode;
}

BSTnode* insertKey(BSTnode* node, int x) {
    if(node == NULL)
        return getNode(x);
    if(x < node->val)
        node->left = insertKey(node->left, x);
    else node->right = insertKey(node->right, x);
    return node;
}

void Inorder(BSTnode* node) {
    if(node != NULL) {
        Inorder(node->left);
        fout << node->val << " ";
        Inorder(node->right);
    }
}

BSTnode* root;

int main() {
    int n, x;
    root = NULL;
    fin >> n;
    /*fin >> x;
    root = insertKey(root, x);*/
    for(int i = 0; i < n; ++i) {
        fin >> x;
        root = insertKey(root, x);
    }
    Inorder(root);
    fout << "\n";
    fin.close();
    fout.close();
    return 0;
}