There are n psychos standing in a line. Each psycho is assigned a unique integer from 1 to n. At each step every psycho who has an id greater than the psycho to his right (if exists) kills his right neighbor in the line. Note that a psycho might kill and get killed at the same step. 

You're given the initial arrangement of the psychos in the line. Calculate how many steps are needed to the moment of time such, that nobody kills his neighbor after that moment. Look notes to understand the statement more precise.

Input

The first line of input contains integer n denoting the number of psychos, (1 ≤ n ≤ 105). In the second line there will be a list of n space separated distinct integers each in range 1 to n, inclusive — ids of the psychos in the line from left to right.

Output

Print the number of steps, so that the line remains the same afterward.

Examples

Input

10
10 9 7 8 6 5 3 4 2 1


Output

2


Input

6
1 2 3 4 5 6


Output

0

Note

In the first sample line of the psychos transforms as follows: [10 9 7 8 6 5 3 4 2 1]  →  [10 8 4] →  [10]. So, there are two steps.
import java.io.*;
import java.util.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;

public class cf319b_2 {
    static int n, prev[], next[];

    static int next(int i) {
        return i == n || next[i] == i ? i : (next[i] = next(next[i]));
    }

    static int prev(int i) {
        return i == -1 || prev[i] == i ? i : (prev[i] = prev(prev[i]));
    }

    public static void main(String[] args) throws IOException {
        /* n = ri();
        int ans = 0;
        int[] a = ria(n);
        prev = new int[n];
        next = new int[n];
        for (int i = 0; i < n; ++i) {
            prev[i] = i;
            next[i] = i;
        }
        boolean[] interesting = new boolean[n];
        int interesting_cnt = 0;
        for(int i = 1; i < n; ++i) {
            if(a[i] < a[i - 1]) {
                interesting[i] = true;
                ++interesting_cnt;
            }
        }
        while (interesting_cnt > 0) {
            int i = prev(n - 1);
            while(i >= 0 && !interesting[i]) {
                i = prev(i - 1);
            }
            int cnt = 0;
            while (i >= 0) {
                if (prev(i - 1) >= 0 && a[i] < a[prev[i - 1]]) {
                    next[i] = next(i + 1);
                    prev[i] = prev[i - 1];
                    cnt = 1;
                    --interesting_cnt;

                    if(next[i] < n && prev[i] >= 0 && a[prev[i]] > a[next[i]]) {
                        interesting[next[i]] = true;
                        ++interesting_cnt;
                    }
                }
                i = prev(i - 1);
            }
            ans += cnt;
            // prln(next);
            // prln(prev);
        }
        prln(ans);*/

        int n = ri(), a[] = ria(n), ans = 0, cur = 1, cur_max = a[0], cur_next_max = -1;
        for(int i = 1; i < n; ++i) {
            if(a[i] > cur_max) {
                cur_max = a[i];
                cur = 1;
                cur_next_max = -1;
            } else if (a[i] > a[i - 1] && a[i] > cur_next_max) {
                cur_next_max = a[i];
                ++cur;
                ans = max(ans, cur);
            }
        }
        prln(ans == 0 ? cur_max == a[n - 1] ? 0 : 1 : ans);
        close();
    }

    static BufferedReader __in = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));
    static StringTokenizer input;
    static Random rand = new Random();

    // references
    // IBIG = 1e9 + 7
    // IRAND ~= 3e8
    // IMAX ~= 2e10
    // LMAX ~= 9e18
    // constants
    static final int IBIG = 1000000007;
    static final int IRAND = 327859546;
    static final int IMAX = 2147483647;
    static final int IMIN = -2147483648;
    static final long LMAX = 9223372036854775807L;
    static final long LMIN = -9223372036854775808L;

    // util
    static int minof(int a, int b, int c) {
        return min(a, min(b, c));
    }

    static int minof(int... x) {
        return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));
    }

    static int minstarting(int offset, int... x) {
        assert x.length > 2;
        return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));
    }

    static long minof(long a, long b, long c) {
        return min(a, min(b, c));
    }

    static long minof(long... x) {
        return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));
    }

    static long minstarting(int offset, long... x) {
        assert x.length > 2;
        return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));
    }

    static int maxof(int a, int b, int c) {
        return max(a, max(b, c));
    }

    static int maxof(int... x) {
        return x.length == 1 ? x[0] : x.length == 2 ? max(x[0], x[1]) : max(x[0], maxstarting(1, x));
    }

    static int maxstarting(int offset, int... x) {
        assert x.length > 2;
        return offset == x.length - 2 ? max(x[offset], x[offset + 1]) : max(x[offset], maxstarting(offset + 1, x));
    }

    static long maxof(long a, long b, long c) {
        return max(a, max(b, c));
    }

    static long maxof(long... x) {
        return x.length == 1 ? x[0] : x.length == 2 ? max(x[0], x[1]) : max(x[0], maxstarting(1, x));
    }

    static long maxstarting(int offset, long... x) {
        assert x.length > 2;
        return offset == x.length - 2 ? max(x[offset], x[offset + 1]) : max(x[offset], maxstarting(offset + 1, x));
    }

    static int powi(int a, int b) {
        if (a == 0) return 0;
        int ans = 1;
        while (b > 0) {
            if ((b & 1) > 0) ans *= a;
            a *= a;
            b >>= 1;
        }
        return ans;
    }

    static long powl(long a, int b) {
        if (a == 0) return 0;
        long ans = 1;
        while (b > 0) {
            if ((b & 1) > 0) ans *= a;
            a *= a;
            b >>= 1;
        }
        return ans;
    }

    static int floori(double d) {
        return (int) d;
    }

    static int ceili(double d) {
        return (int) ceil(d);
    }

    static long floorl(double d) {
        return (long) d;
    }

    static long ceill(double d) {
        return (long) ceil(d);
    }

    static void shuffle(int[] a) {
        int n = a.length - 1;
        for (int i = 0; i < n; ++i) {
            int ind = randInt(i, n);
            int swap = a[i];
            a[i] = a[ind];
            a[ind] = swap;
        }
    }

    static void shuffle(long[] a) {
        int n = a.length - 1;
        for (int i = 0; i < n; ++i) {
            int ind = randInt(i, n);
            long swap = a[i];
            a[i] = a[ind];
            a[ind] = swap;
        }
    }

    static void shuffle(double[] a) {
        int n = a.length - 1;
        for (int i = 0; i < n; ++i) {
            int ind = randInt(i, n);
            double swap = a[i];
            a[i] = a[ind];
            a[ind] = swap;
        }
    }

    static <T> void shuffle(T[] a) {
        int n = a.length - 1;
        for (int i = 0; i < n; ++i) {
            int ind = randInt(i, n);
            T swap = a[i];
            a[i] = a[ind];
            a[ind] = swap;
        }
    }

    static void rsort(int[] a) {
        shuffle(a);
        sort(a);
    }

    static void rsort(long[] a) {
        shuffle(a);
        sort(a);
    }

    static void rsort(double[] a) {
        shuffle(a);
        sort(a);
    }

    static int randInt(int min, int max) {
        return rand.nextInt(max - min + 1) + min;
    }

    // input
    static void r() throws IOException {
        input = new StringTokenizer(__in.readLine());
    }

    static int ri() throws IOException {
        return Integer.parseInt(__in.readLine());
    }

    static long rl() throws IOException {
        return Long.parseLong(__in.readLine());
    }

    static int[] ria(int n) throws IOException {
        int[] a = new int[n];
        input = new StringTokenizer(__in.readLine());
        for (int i = 0; i < n; ++i) a[i] = Integer.parseInt(input.nextToken());
        return a;
    }

    static long[] rla(int n) throws IOException {
        long[] a = new long[n];
        input = new StringTokenizer(__in.readLine());
        for (int i = 0; i < n; ++i) a[i] = Long.parseLong(input.nextToken());
        return a;
    }

    static char[] rcha() throws IOException {
        return __in.readLine().toCharArray();
    }

    static String rline() throws IOException {
        return __in.readLine();
    }

    static int rni() throws IOException {
        input = new StringTokenizer(__in.readLine());
        return Integer.parseInt(input.nextToken());
    }

    static int ni() {
        return Integer.parseInt(input.nextToken());
    }

    static long rnl() throws IOException {
        input = new StringTokenizer(__in.readLine());
        return Long.parseLong(input.nextToken());
    }

    static long nl() {
        return Long.parseLong(input.nextToken());
    }

    // output
    static void pr(int i) {
        __out.print(i);
    }

    static void prln(int i) {
        __out.println(i);
    }

    static void pr(long l) {
        __out.print(l);
    }

    static void prln(long l) {
        __out.println(l);
    }

    static void pr(double d) {
        __out.print(d);
    }

    static void prln(double d) {
        __out.println(d);
    }

    static void pr(char c) {
        __out.print(c);
    }

    static void prln(char c) {
        __out.println(c);
    }

    static void pr(char[] s) {
        __out.print(new String(s));
    }

    static void prln(char[] s) {
        __out.println(new String(s));
    }

    static void pr(String s) {
        __out.print(s);
    }

    static void prln(String s) {
        __out.println(s);
    }

    static void pr(Object o) {
        __out.print(o);
    }

    static void prln(Object o) {
        __out.println(o);
    }

    static void prln() {
        __out.println();
    }

    static void pryes() {
        __out.println("yes");
    }

    static void pry() {
        __out.println("Yes");
    }

    static void prY() {
        __out.println("YES");
    }

    static void prno() {
        __out.println("no");
    }

    static void prn() {
        __out.println("No");
    }

    static void prN() {
        __out.println("NO");
    }

    static void pryesno(boolean b) {
        __out.println(b ? "yes" : "no");
    }

    ;

    static void pryn(boolean b) {
        __out.println(b ? "Yes" : "No");
    }

    static void prYN(boolean b) {
        __out.println(b ? "YES" : "NO");
    }

    static void prln(int... a) {
        for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i) ;
        __out.println(a[a.length - 1]);
    }

    static void prln(long... a) {
        for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i) ;
        __out.println(a[a.length - 1]);
    }

    static <T> void prln(Collection<T> c) {
        int n = c.size() - 1;
        Iterator<T> iter = c.iterator();
        for (int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i) ;
        if (n >= 0) __out.println(iter.next());
    }

    static void h() {
        __out.println("hlfd");
    }

    static void flush() {
        __out.flush();
    }

    static void close() {
        __out.close();
    }
}