Unique Employees for Subtasks

You are given a list of projects. Each project has a certain number of subtasks, and each subtask requires one unique employee. Your task is to determine the minimum number of unique employees required to complete the subtasks for each project.

In other words, for a project with n subtasks, you will need exactly n employees. Mathematically, if the number of subtasks for a project is represented by \( n \), then the answer is \( n \).

For example, if there are two projects with 12 and 7 subtasks respectively, the output will be "12 7".

inputFormat

The input is given via standard input (stdin) and consists of two lines:

• The first line contains a single integer \( N \) representing the number of projects.
• The second line contains \( N \) space-separated integers, where the \( i\)-th integer represents the number of subtasks for the \( i\)-th project.

outputFormat

Output a single line to standard output (stdout) with \( N \) space-separated integers. Each integer is the minimum number of unique employees required for the corresponding project.

1
12

12