#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
const int BUF = 100005;


int nVal;
int val[BUF];

void read() {
    cin >> nVal;
    for (int i = 0; i < nVal; ++i) {
        cin >> val[i];
    }
}


void work() {
    sort(val, val + nVal);
    
    multimap<int, int> leng2val;

    for (int i = 0; i < nVal; ++i) {
        int toAdd = 1;
        for (multimap<int, int>::reverse_iterator it = leng2val.rbegin();
             it != leng2val.rend();
             ++it) {
            
            if (val[i] % it->second == 0) {
                toAdd = it->first + 1;
                break;
            }
        }
        leng2val.insert(make_pair(toAdd, val[i]));
    }

    cout << leng2val.rbegin()->first << endl;
}


int main() {
    read();
    work();
    return 0;
}