Guess the Hidden Sequence

Ehab has a hidden permutation ( s ) of length ( n ), consisting of distinct integers from 1 to ( n ). Originally, you were allowed to interact with the sequence via a query function, but in this problem, the hidden sequence is given directly as input. Your task is to reconstruct the hidden sequence by reading the input and printing the sequence exactly as provided.

Input Format: The first line contains a single integer ( n ) ((1 \leq n \leq 10^3)). The second line contains ( n ) space-separated integers representing a permutation of ( {1, 2, \dots, n} ).

Output Format: Print the hidden sequence in one line with each number separated by a single space.

inputFormat

The input is read from standard input (stdin) and consists of two lines. The first line contains an integer ( n ), the length of the sequence. The second line contains ( n ) space-separated integers forming a permutation of numbers from 1 to ( n ).

outputFormat

Output the hidden sequence on a single line. The elements must be separated by a single space.## sample

4
2 4 1 3

2 4 1 3