beecrowd | 1171
# Number Frequence

**Timelimit: 1**

Adapted by Neilor Tonin, URI Brazil

In this problem your job is to read some positive and integer numbers and print how many times each number appears in the input, you must write each of the distinct values that appear in the input, ordering by ascending value.

The input contains only one test case. The first line of input contains one integer N, which indicates the quantity of numbers that will be read to X (1 ≤ X ≤ 2000) in the sequence. Each number don't appears more than 20 times in the problem input.

Print the output according to the example provided below, indicating how many times each number appears in the input file, by ascending order of value.

Input Sample | Output Sample |

7 |
4 aparece 1 vez(es) |