local mfl = math.floor
local mma = math.max
local function lower_bound(ary, x, min, k)
  local max = #ary
  if(x <= ary[min]) then return min end
  if(ary[max] < x) then return max + 1 end
  while(1 < max - min) do
    local mid = mfl((min + max) / 2)
    if(ary[mid] < x) then
      min = mid
    else
      max = mid
    end
  end
  return max
end

local n = io.read("*n")
local t, len = {}, {}
for i = 1, n do
  t[i] = io.read("*n")
  len[i] = 1
end
table.sort(t)
for i = n - 1, 1, -1 do
  local k = 2
  local pos = i + 1
  while pos <= n do
    pos = lower_bound(t, k * t[i], pos)
    if k * t[i] == t[pos] then
      len[i] = mma(len[i], len[pos] + 1)
    end
    k = k + 1
  end
end
local ret = 1
for i = 1, n - 1 do
  ret = mma(ret, len[i])
end
print(ret)