#pragma target("avx") #include using namespace std; typedef long long ll; typedef long double ld; typedef pair P; typedef vector V; typedef unordered_map U_MAP; typedef priority_queue pq; typedef priority_queue, greater> rpq; const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10; const ll LINF = 1e18; #define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++) #define rrep(i, a, b) for (ll i = (a); i < (b); i++) #define rrrep(i, a, b) for (ll i = (a); i >= (b); i--) #define all(v) (v).begin(), (v).end() #define Size(n) (n).size() #define Cout(x) cout << (x) << endl #define doublecout(a) cout << fixed << setprecision(15) << a << endl; #define fi first #define se second #define m_p make_pair #define p_b push_back string to_string(string s) { return '"' + s + '"'; } string to_string(const char* s) { return to_string((string)s); } string to_string(bool b) { return (b ? "true" : "false"); } template string to_string(pair p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; } template string to_string(A v) { bool first = true; string res = "{"; for (const auto& x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res; } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); } #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) //------ Believe yourself as a genius!!!!!! ------ int dy[] = {1, 0, -1, 0}; int dx[] = {0, 1, 0, -1}; // int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1}; string alph("abcdefghijklmnopqrstuvwxyz"), s; ll n, cnt, ans, a[ohara], b, c, d, tmp, m, h, w, x, y, sum, k, q; ll dp[ohara]; queue que[3 * 100000 + 1]; vector divisor(ll n) { vector ret; for (ll i = 1; i * i <= n; i++) { if (n % i == 0) { ret.push_back(i); if (i * i != n) ret.push_back(n / i); } } sort(begin(ret), end(ret)); return (ret); } int main(void) { cin.tie(0); cout.tie(0); ios::sync_with_stdio(false); cin >> n; rep(i, n) cin >> a[i]; rrrep(i, n - 1, 0) { que[a[i]].push(i); } rep(i, n + 1) dp[i] = 1; rrrep(i, n - 1, 0) { vector yakusuu = divisor(a[i]); rep(j, Size(yakusuu)) { if (yakusuu[j] == a[i]) continue; ll to = que[yakusuu[j]].front(); dp[to] = max(dp[i] + 1, dp[to]); } que[a[i]].pop(); } rep(i, n) { ans = max(ans, dp[i]); } Cout(ans); return 0; }