---
category_name: school
problem_code: TSORT
problem_name: 'Turbo Sort'
languages_supported:
- ADA
- ASM
- BASH
- BF
- C
- 'C99 strict'
- CAML
- CLOJ
- CLPS
- 'CPP 4.3.2'
- 'CPP 4.9.2'
- CPP14
- CS2
- D
- FORT
- FS
- GO
- HASK
- ICK
- ICON
- JAVA
- JS
- 'LISP clisp'
- 'LISP sbcl'
- LUA
- NEM
- NICE
- NODEJS
- 'PAS fpc'
- 'PAS gpc'
- PERL
- PHP
- PIKE
- PRLG
- PYPY
- PYTH
- 'PYTH 3.4'
- RUBY
- SCALA
- 'SCM chicken'
- 'SCM guile'
- 'SCM qobi'
- ST
- TEXT
- WSPC
max_timelimit: '5'
source_sizelimit: '50000'
problem_author: admin
problem_tester: null
date_added: 1-12-2008
tags:
- admin
time:
view_start_date: 1232710998
submit_start_date: 1232710998
visible_start_date: 1232710998
end_date: 1735669800
current: 1492507648
layout: problem
---
All submissions for this problem are available.Given the list of numbers, you are to sort them in non decreasing order.
### Input
_t_ – the number of numbers in list, then _t_ lines follow \[_t_ Each line contains one integer: _N_ \[0 N Output
Output given numbers in non decreasing order.
### Example
**Input:**
<pre>
5
5
3
6
7
1
</pre>**Output:**
<pre>
1
3
5
6
7
</pre>