Feasible Watering Plan

This is a submission-answer problem. You are provided with water requirements for n plants and you need to submit a feasible watering plan that satisfies all the requirements.

For each plant i (with 1 ≤ i ≤ n), let the water requirement be denoted by a_i. A plan is considered valid if the water given w_i satisfies the condition \[ w_i \geq a_i, \] for every plant. If there are multiple valid solutions, you may output any one.

The input consists of a single test case in each file and you will be provided with 10 input files.

You can download the input files from the attachment watering.in.zip.

inputFormat

The first line of input contains an integer n (1 ≤ n ≤ 10⁵), the number of plants.

The second line contains n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹), where each integer represents the minimum water required for the corresponding plant.

outputFormat

Output a single line containing n space-separated integers w₁, w₂, ..., w_n such that for every i (1 ≤ i ≤ n), the condition \[ w_i \geq a_i \] is satisfied. Any valid watering plan is acceptable.

sample

3
1 2 3

1 2 3