#include "stdafx.h"
#include<iostream>
#include<string>
#include<stdio.h>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;
int Partition(int a[], int left, int right) {
int temp = a[left];
while (left < right) {
while (a[right] > temp &&left < right) right--;
a[left] = a[right];
while (a[left] < temp && left < right) left++;
a[right] = a[left];
}
a[left] = temp;
return left;
}
void quicksort(int a[], int left, int right) {
if (left < right) {
int pos = Partition(a, left, right);
quicksort(a, left, pos - 1);
quicksort(a, pos + 1, right);
}
}
int main()
{
int x;
cin >>x;
int data[6];
for (int i = 0;i < 6;i++) {
scanf_s("%d", &data[i]);
}
quicksort(data, 0, 5);
for (int i = 0;i < 6;i++) {
printf("%d ", data[i]);
}
return 0;
}