Submit solution

Points:
3 (partial)

Time limit:
0.5s

C#
0.75s

Haskell
1.0s

Java
0.6s

Python
1.0s

Memory limit:
3M

C#
28M

Haskell
6M

Python
12M

Authors:

Problem type

##### Brute Force Practice 1 — Easy Version

Given a permutation of the integers , output the permutation after it has been sorted.

#### Input Specification

The first line will contain the integer .

The next line will contain integers, a permutation of the integers .

#### Output Specification

The sorted permutation on a single line.

#### Sample Input

```
3
2 1 3
```

#### Sample Output

`1 2 3`

## Comments