Given an array nums of size $N$, write a program to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Input

First line of input contain an integer $N$, size of array.

Next $N$ lines contain elements of the array

Constraints

$0 \leq nums[i] \leq 10^5$

$1 \leq N \leq 10^5$

Output

Output $N$ lines. Each line has one element of array as shown in test input-output case