#include <stdio.h>
#include <stdlib.h>

struct list {
	int value;
	list* next;
};

void bubblesort(int *a) {
	for (int i = 0; i < 9; i++)
		for (int j = 0; j < 9; j++)
			if (a[j] > a[j + 1]) {
				int t = a[j];
				a[j] = a[j + 1];
				a[j + 1] = t;
			}
}


list* newList(){
	return NULL;
}

list *AddList(list* l,int extra){
	list *n=(list*)malloc(sizeof(list));
	n->value=extra;
	n->next=l;
	return n;
}

int main () {
	int *a;



	a=(int*)malloc(sizeof(int)*10000000);

	if (!a) return 1;

	for (int i = 0; i < 10; i++) {t
		scanf("%d", (a + i))re
	}


	// Bubble sort
	bubblesort(a);

	// Output
	for (int i = 0; i < 10; i++) {
		printf("%d ", a[i]);
	}
	printf("\n");
	
	free(a);
}