"Linden has an array of positive integers "arr with a length of $\{-\backslash$infty$\}$n$^\{$m$\}$

Linden can carry out the following operation:

For each index $""""$ from $1$~to$^\{1$m$\}$n$^\{$nn$\}$ replace $=$arr$[$i$]^\{$nn$\}$ with max$(0,$ arr$[$i$]-1).$

Linden intends to repeat this operation until the array $""$arr$""$ becomes sorted in ascending order, meaning that arr$[1]$ s arr$[2]$ s$...$ s arr$[$n$].$ How many operations will Linden need to perform? It can be proven within the problem's constraints that a finite number of operations will be performed.

Input:

For each test case:

The first line contains a single integer $"$n$"$n$"(2\backslash$le n$)\backslash$le$50)-$the length of the array $""$arr$"".$ The second line contains $\{\}^\{$mn$\}$n$^\{$mn$\}$ integers "arr$[1]^\{$nn$\},$ "arr$[2]",...,""$an$\}$arr$[$n$]^\{$mn$\}(1\backslash$le arr$[$i$]\backslash$le$10^\{\backslash$wedge$\}9)-$the elements of the array $""$arr$"".$

Output:

For each test case, output a single integer $-$ the number of operations that Linden needs to perform to sort the$$array$""$arr$"".$