import algorithm, complex, macros, math, sequtils, sets, strformat, strutils, sugar, tables

macro unpack*(rhs: seq, cnt: static[int]): auto =
  let v = genSym(); result = quote do:(let `v` = `rhs`;())
  for i in 0 ..< cnt: result[1].add(quote do:`v`[`i`])

template input*(T: typedesc, cnt: Natural = 1): untyped =
  let line = stdin.readLine.split(" ")
  when T is int:         line.map(parseInt).unpack(cnt)
  elif T is float:       line.map(parseFloat).unpack(cnt)
  elif T is string:      line.unpack(cnt)
  elif T is char:        line.mapIt(it[0]).unpack(cnt)
  elif T is seq[int]:    line.map(parseint)
  elif T is seq[float]:  line.map(parseFloat)
  elif T is seq[string]: line
  elif T is seq[char]:   line.mapIt(it[0])

proc `|=`*(n: var int, m: int) = n = n or m
proc `|=`*(n: var bool, m: bool) = n = n or m
proc `&=`*(n: var int, m: int) = n = n and m
proc `&=`*(n: var bool, m: bool) = n = n and m
proc `^=`*(n: var int, m: int) = n = n xor m
proc `^=`*(n: var bool, m: bool) = n = n xor m
proc `%=`*(n: var int, m: int) = n = n mod m
proc `/=`*(n: var int, m: int) = n = n div m
proc `<<=`*(n: var int, m: int) = n = n shl m
proc `>>=`*(n: var int, m: int) = n = n shr m
proc `<?=`*(n: var SomeNumber, m: SomeNumber) = n = min(n, m)
proc `>?=`*(n: var SomeNumber, m: SomeNumber) = n = max(n, m)
proc newSeq2*[T](n1, n2: Natural): seq[seq[T]] = newSeqWith(n1, newSeq[T](n2))
proc newSeq3*[T](n1, n2, n3: Natural): seq[seq[seq[T]]] = newSeqWith(n1, newSeqWith(n2, newSeq[T](n3)))

# -------------------------------------------------- #

proc divisor(N: int): seq[int] =
  result = newSeq[int]()
  for i in 1 .. N:
    if i * i > N:
      break
    if N mod i == 0:
      result.add(i)
      if i * i != N:
        result.add(N div i)

let N = input(int)
let A = @[0] & input(seq[int])
var place = newSeq2[int](3 * 10 ^ 5 + 1, 0)
for k in 1 .. 3 * 10 ^ 5:
  place[k].add(0)
for i, a in A:
  place[a].add(i)
for k in 1 .. 3 * 10 ^ 5:
  place[k].add(N + 1)

var dp = newseq[int](N + 1)
for i in 1 .. N:
  if A[i] == 1:
    dp[i] = 1
    continue
  #echo divisor(A[i])
  for d in divisor(A[i]):
    if d == A[i]:
      continue
    var j = place[d][place[d].lowerBound(i) - 1]
    #echo place[d], " ", j
    dp[i] >?= dp[j] + 1
echo max(dp)
#echo dp