#include<stdio.h>
void quicksort(int array[],int left,int right){
if(left > right){
return;
}
int temp = array[left];
int i = left;
int j = right;
int t;
while(i != j){
while(array[j]>=temp && i<j){
j--;
}
while(array[i]<=temp&&i<j){
i++;
}
if(i<j){
t = array[j];
array[j] = array[i];
array[i] = t;
}
}
array[left] = array[i];
array[i] = temp;
quicksort(array,left,i-1);
quicksort(array,i+1,right);
}
int main(){
int array[5];
for(int i=0;i<5;i++){
scanf("%d",&array[i]);
}
quicksort(array,0,4);
for(int i=0;i<5;i++){
printf("%d\t",array[i]);
}
return 0;
}