Code Submission Evaluation System Login

CSES Problem Set

Nearest Smaller Values


Task | Statistics


CSES - Nearest Smaller ValuesCSES - Nearest Smaller Values

Time limit:1.00 s Memory limit:512 MB

Given an array of $n$ integers, your task is to find for each array position the nearest position to its left having a smaller value.

Input

The first input line has an integer $n$: the size of the array.

The second line has $n$ integers $x_1,x_2,\dots,x_n$: the array values.

Output

Print $n$ integers: for each array position the nearest position with a smaller value. If there is no such position, print $0$.

Constraints
Example

Input:
8
2 5 1 4 8 3 2 5


Output:
0 1 0 3 4 3 3 7