Move zeroes#4760

Move zeroes

1 second
128 megabytes
Very easy

Sequence of integers is given. Rearrange all 's to the end of it while maintaining the relative order of non-zero elements.

Input

The first line contains the number of elements (1 \leq n \leq 100) in the sequence. The second line contains integers, each not greater than by absolute value.

Output

Print the sequence so that all its 's are moved to the end, and the relative order of non-zero elements is not changed.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading