## Problem B. Altitude and visibility ≡

 Author: A. Klenin Time limit: 1 sec Input file: input.txt Memory limit: 256 Mb Output file: output.txt

### Statement

Consider a sequence of numbers a1, …, aN, representing heights. Let's say that element ai has a visibility radius d if ai ≥ aj for all j such that 1 ≤ j ≤ N and |i − j| < d.

You task is to find maximum di for every ai.

### Input file format

Input file contains integer N followed by N integers ai.

### Output file format

Output file must contain N integers di — maximum visibility for every ai. If maximum visibility radius for element ai is unlimited, output di = 0.

### Constraints

1 ≤ N ≤ 106, 0 ≤ ai ≤ 109

### Sample tests

No. Input file (input.txt) Output file (output.txt)
1
1
10

0 
2
6
1 5 2 2 1 4

1 0 1 2 1 4 

0.039s 0.008s 15