#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *next;
};
int main()
{
int n, i;
scanf("%d", &n);
struct node *h, *q, *p;
h = (struct node *)malloc(sizeof(struct node ));
h -> next = NULL;
for(i = 0; i < n; i++)
{
p = (struct node *)malloc(sizeof(struct node ));
p -> next = NULL;
scanf("%d", &p -> data);
q = h;
while(q -> next)
{
if(q -> next -> data > p -> data)break;
q = q -> next;
}
p -> next = q -> next;
q -> next = p;
}
p = h -> next;
printf("%d", p -> data);
p = p -> next;
while(p)
{
printf(" %d", p -> data);
p = p -> next;
}
return 0;
}