#include using namespace std; #define all(c) (c).begin(),(c).end() #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++) #define rep(i,n) REP(i,0,n) #define iter(c) __typeof((c).begin()) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) #define mem(a) memset(a,0,sizeof(a)) #define pd(a) printf("%.10f\n",a) #define pb(a) push_back(a) #define in(a) insert(a) #define pi M_PI #define R cin>> #define F first #define S second #define C class #define ll long long #define ln cout<<'\n' templatevoid pr(T a){cout<void pr(T a,T2 b){cout<void pr(T a,T2 b,T3 c){cout<void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; void Main() { int n; cin >> n; int a[n],d[1000001]; mem(d); rep(i,n) { cin >> a[i]; d[a[i]]=1; } sort(a,a+n); rrep(i,n) { for(int j=1; j*j<=a[i]; j++) { if(a[i]%j==0) { if(a[i]/j!=1) d[j]=max(d[j],d[a[i]]+1); if(j!=1) d[a[i]/j]=max(d[a[i]/j],d[a[i]]+1); } } } int ans=0; rep(i,n) ans=max(ans,d[a[i]]); pr(ans); } int main() { ios::sync_with_stdio(0);cin.tie(0); Main();return 0; }