Sticks Problem

Sofia has $n$ sticks of different lengths. One day, she arranged them in a row, with lengths s_1, s_2, s_3, \ldots, s_n. After measuring each stick s_k (1 \le k \le n), she noticed that for some pairs of sticks s_i and s_j (1 \le i < j \le n), the length of every stick placed between s_i and s_j is strictly greater than s_i and strictly less than s_j.

Given the sequence of lengths s_1, s_2, s_3, \ldots, s_n, find the maximum possible value of the difference j - i.

Output

For each test case, print the maximum value of j - i on a separate line. If no such indices $i$ and $j$ exist, print $-1$.