import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N;
int[] X;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      X = new int[N];
      foreach (i; 0 .. N) {
        X[i] = readInt();
      }
      X.sort;
      
      const lim = X[$ - 1] + 1;
      auto has = new bool[lim];
      foreach (i; 0 .. N) {
        has[X[i]] = true;
      }
      auto dp = new int[lim];
      foreach (a; 0 .. lim) {
        if (has[a]) {
          dp[a] = 1 + dp[1];
          for (int d = 2; d * d <= a; ++d) {
            if (a % d == 0) {
              chmax(dp[a], 1 + dp[d]);
              chmax(dp[a], 1 + dp[a / d]);
            }
          }
        }
      }
      debug {
        writeln(dp[0 .. min($, 10)]);
      }
      writeln(dp.maxElement);
    }
  } catch (EOFException e) {
  }
}