#ifndef SHO_LOCAL #include #define debug(...) ; #else #include "debug.h" #endif #define all(x) (x).begin(), (x).end() using namespace std; using ll = long long; const int N = (int)1e5 + 4; int A[N]; int pos[N]; int dp[N]; int main() { iostream::sync_with_stdio(0), cin.tie(0); for (int i = 0; i < N; i += 4) { pos[i] = -1; pos[i + 1] = -1; pos[i + 2] = -1; pos[i + 3] = -1; } int n; cin >> n; for (int i = 0; i < n; i++) { cin >> A[i]; } int ans = 1; for (int i = 0; i < n; i++) { dp[i] = 1; int a = A[i]; for (int d = 1; d * d <= a; d++) { if (a % d) continue; int p1 = pos[d]; int p2 = pos[a / d]; int a = p1 != -1 ? dp[p1] + 1 : 0; int b = p2 != -1 ? dp[p2] + 1 : 0; dp[i] = max({dp[i], a, b}); } pos[a] = i; ans = max(ans, dp[i]); } cout << ans << '\n'; return 0; }