#include int main () { int n = 0; int a[100000] = {}; int res = 0; int ans = 0; int max[100000] = {}; res = scanf("%d", &n); for (int i = 0; i < n; i++) { res = scanf("%d", a+i); } for (int i = 0; i < n; i++) { if (max[a[i]-1] > max[0]) { max[a[i]-1]++; } else { max[a[i]-1] = max[0]+1; } for (int p = 2; p*p <= a[i]; p++) { if (a[i]%p == 0) { if (max[a[i]-1] <= max[p-1]) { max[a[i]-1] = max[p-1]+1; } if (max[a[i]-1] <= max[a[i]/p-1]) { max[a[i]-1] = max[a[i]/p-1]+1; } } } if (max[a[i]-1] > ans) { ans = max[a[i]-1]; } } printf("%d\n", ans); return 0; }