Reverse an array in-place.

Difficulty: Easy

Phase: 6 · Mixed Logical Challenges

XP Reward: 10 XP

Topics: Mixed Logical Challenges, Easy

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given N followed by N integers containing only 0, 1, and 2, sort them in-place (Dutch National Flag problem). Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 6 2 0 2 1 1 0

Output: 0 0 1 1 2 2

Explanation: Sample execution for input 6 2 0 2 1 1 0