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].

Constraints

0 ≤ nums[i] ≤ 100000 1 ≤ n ≤ 100000

Input

First line of input contain an integer n, size of array.

Next n lines contain elements of the array

Output

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