Multiple Subsequence

You are given a sequence of natural numbers. Find the length of the longest subsequence in which every element is a multiple of the element before it and strictly larger than it.

A subsequence is built by picking some elements of the original sequence without changing their order. A subsequence with one element always satisfies the condition, so the answer is never smaller than 1.

The first line contains the length of the sequence $N$ ($1 \le N \le 100000$).

Each of the next $N$ lines contains one element of the sequence, in order. Every element is a natural number smaller than $1000000$.

Print the length of the longest subsequence that satisfies the condition on the first line.