#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define pb push_back #define all(x) x.begin(),x.end() //#define mp make_pair #define vi vector #define vvi vector #define vll vector #define vvll vector #define vs vector #define vvs vector #define vc vector #define vvc vector #define pii pair #define pllll pair #define vpii vector> #define vpllll vector> #define vpis vector> #define vplls vector> #define vpsi vector> #define vpsll vector> template void chmax(T &a, const T &b) {a = (a > b? a : b);} template void chmin(T &a, const T &b) {a = (a < b? a : b);} using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = numeric_limits::max() / 2; const ld pi = 3.1415926535897932384626433832795028; const ll mod = 998244353; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, -1, 1, -1, 1}; #define int long long vector quotients(const int n) { vector ret; for(int i = 1; i * i <= n; i++) { if(n%i != 0) continue; ret.push_back(i); if(i * i != n) ret.push_back(n / i); } sort(all(ret)); return ret; } void solve() { const int MAXN = 100100; int n; cin >> n; vi a(n); FOR(n) cin >> a[i]; // sort(all(a)); vi dp(MAXN, -1); for(auto e : a) { int mx = 1; for(auto f : quotients(e)) if(dp[f] != -1) { chmax(mx, dp[f] + 1); } chmax(dp[e], mx); // rep(i, MAXN) if(dp[i] != -1) cout << i << "->" << dp[i] << endl; // cout << "\n"; } cout << *max_element(all(dp)) << endl; } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }