（笛卡尔树）对于一个给定的两两不等的正整数序列，笛卡尔树是这

const
  SIZE = 100;
  INFINITY = 1000000;
var
  n, maxDeep, num, i : integer;
  a : array[1..SIZE] of integer;
procedure solve(left, right, deep : integer);
var
  i, j, min : integer;
begin
  if deep > maxDeep then
  begin
    maxDeep := deep;
    num := 1;
  end
  else if deep = maxDeep then
    1;
  min := INFINITY;
  for i := left to right do
    if min > a[i] then
    begin
      min := a[i];
      2;
    end;
  if left < j then
    3;
  if j < right then
    4;
end;
begin
  readln(n);
  for i := 1 to n do
    read(a[i]);
  maxDeep := 0;
  solve(1, n, 1);
  writeln(maxDeep, ' ', num);
end.