#include<stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;

int TurboSort()
{
	int T = 0, num = -1, c = 0, j = 0;
	scanf("%d\n", &T);
	char buffer[1000000];
	int *A = new int[T];
	while ((c = fread(buffer, 1, 1000000, stdin)) > 0)
	{
		for (int i = 0; i < c; i++)
		{
			if (buffer[i] == ‘\n‘)
			{
				A[j++] = num;
				num = -1;
			}
			else
			{
				if (-1 == num) num = buffer[i] - ‘0‘;
				else num = num * 10 + buffer[i] - ‘0‘;
			}
		}
	}
	if (-1 != num) A[T-1] = num;
	sort(A, A+T);

	for (int i = 0; i < T; i++)
	{
		printf("%d\n", A[i]);//使用cout会超时，最少慢5倍
	}
	delete [] A;
	return 0;
}