#include using namespace std; #define FOR(i, n) for(int i = 0; i < (n); i++) #define MEM(a, x) memset(a, x, sizeof(a)) #define ALL(a) a.begin(), a.end() #define UNIQUE(a) a.erase(unique(ALL(a)), a.end()) typedef long long ll; typedef pair P; int n, dp[1000005]; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin >> n; vector x(n); FOR(i, n) { cin >> x[i]; dp[x[i]]++; } sort(ALL(x)); int ma = 1; FOR(i, n) { for (int j = 2*x[i]; j <= x.back(); j += x[i]) dp[j] = max(dp[j], dp[x[i]] + 1); ma = max(ma, dp[x[i]]); } cout << ma << endl; return 0; }