#include <iostream>
using namespace std;

int a[10];
int partition(int left, int right);
void swap(int i, int j);
void sort(int i, int j);

int main()
{
int i,j=0,k=9;
for(i=0;i<10;i++)
cin >> a[i];

sort(j,k);
for(i=0;i<10;i++)
cout << a[i] << endl;
}

void sort(int left, int right)
{
int p;
if(left>=right)
return;
p = partition(left, right);

sort(left,p-1);
sort(p+1,right);
}

int partition(int left, int right)
{
int first=left, pivot=right–;
while(left<=right)
{
while(a[left]<a[pivot])
left++;
while((right>=first)&&(a[right]>=a[pivot]))
right–;
if(left<right)
{
swap(left,right);
left++;
}
}
if(left!=pivot)
swap(left,pivot);

return left;
}

void swap(int i, int j)
{
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}