import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string rstring(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T rtype(T)(){ return rstring.to!T; } alias rint = rtype!int, rlong = rtype!long, rreal = rtype!real;
T[] rtypes(T)(int n){ return n.iota.map!(i => rtype!T()).array; } alias rint = rtypes!int, rlong = rtypes!long, rreal = rtypes!real;
T[][] rtypess(T)(int n, int m){ return n.iota.map!(i => rtypes!T(m)).array; } alias rint = rtypess!int, rlong = rtypess!long, rreal = rtypess!real;

// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

void solve(){
	int n = rint;
	long[] as = rlong(n);
	
	long[] au = [0];
	long[long] vm = [0: 0];
	long maxv = 1;
	foreach(a; as){
		if(au[$ - 1] < a){
			au ~= a;
			vm[au[$ - 1]] = 1;
		}
		else{
			while(au[$ - 1] > a){
				au.length -= 1;
			}
			if(au[$ - 1] < a){
				au ~= a;
				vm[au[$ - 1]] = 1;
			}
			vm[au[$ - 1]] += 1;
			maxv = max(maxv, vm[au[$ - 1]]);
		}
	}
	maxv.writeln;
}
