Replacement#4892

Replacement

1 second
128 megabytes
Medium

Given a sequence of positive integers. You must replace each element with the next nearest one (with a larger index) that is strictly larger than its value. If there is no larger element, replace this element with zero.

Input

First line contains the number of elements (1 \le n \le 10^5). Second line contains positive integers a_i (a_i \le 10^9) - the values of sequence elements.

Output

Print the desired sequence, separating the neighboring elements with a single space.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading