def inpf() a=gets.chomp.split(" ").map(&:to_f)end

def inps() a=gets.chomp.split(" ")end

def copy(a) Marshal.load(Marshal.dump(a)) end

def kaijo(n,r = 10**9+7)(n < 2)? 1 : (2..n).inject{|memo,u|memo=(memo*u)%r} end

def na(n,d=0) Array.new(n,d)end

def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end

def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end

def inp() a=gets.chomp.split(" ").map(&:to_i)end

def r_up(a, b) (a+b-1)/b end

def b_ser(bot, top, a, target, u_r_f = nil, mm = nil)
  mid = (bot + top)/2
  if(a[mid] == target)
    if(u_r_f == nil)
      return mid
    else
      return mid if(bot == mid)
      return b_ser(bot, mid, a, target, u_r_f, mid)
    end
  end
  if(bot == mid)
    return nil if(u_r_f == nil)
    return mid + ((a[mid] < target)? 1 : 0)
  end
  return (a[mid] > target)? b_ser(bot, mid, a, target, u_r_f, mm) : b_ser(mid, top, a, target, u_r_f, mm)
end
n = inp[0]
it = []
n.times do
  it << inp[0]
end
len = [it.shift]
it.each do |d|
  ind = nil
  if(len.size == ind = b_ser(0,len.size,len,d,true))
    it[ind] = d
  else
    len.push(d)
  end
end
p len.size