//UVA Problem 11462 Solution /** * @Author : Jesmin Akther */
#include <stdio.h>
long int n, array[2000005], c, d, t;
int main()
{
while(scanf("%ld", &n)==1 )
{
if(n==0) break;
for (c = 0; c < n; c++)
{
scanf("%ld", &array[c]);
}
for (c = 1 ; c <= n - 1; c++) {
d = c;
while ( d > 0 && array[d] < array[d-1]) {
t = array[d];
array[d] = array[d-1];
array[d-1] = t;
d--;
}
}
for (c = 0; c < n ; c++) {
printf("%ld", array[c]);
if(c<(n-1))
printf(" ");
}
printf("\n");
}
return 0;
}