#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <functional>
#include <complex>
#include <climits>
#include <random>
using namespace std;
#define ll long long
#define pb push_back
#define ull unsigned long long
#define F first
#define S second
#define all(v) v.begin(), v.end()
const int inf = INT_MAX;
const ll P = 337;
int a[300005];
int mx[300005];
int nxt[300005];
int lp[300005];
void solve(){
int n;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
mx[a[i]] = i;
nxt[a[i]] = i;
}
for(int i = 1; i <= n; i++){
for(int j = 1; j * j <= a[i]; j++){
if(a[i] % j != 0) continue;
nxt[a[i]] = max(nxt[a[i]], mx[j]);
nxt[j] = max(nxt[j], mx[a[i]]);
if(a[i] / j != j){
nxt[a[i]] = max(nxt[a[i]], mx[a[i] / j]);
nxt[a[i] / j] = max(nxt[a[i] / j], mx[a[i]]);
}
}
}
vector<int> v;
for(int i = 1; i <= n; i++){
if(v.empty()){
v.pb(nxt[a[i]]);
continue;
}
if(i == v.back() + 1){
v.pb(nxt[a[i]]);
}
else{
if(nxt[a[i]] > v.back()){
v.pop_back();
v.pb(nxt[a[i]]);
}
}
}
cout << v.size();
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int xach = 1;
//cin >> xach;
while(xach--) solve();
}
/*
*
*/
