#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cmath>
#include <time.h>
#include <tuple>
#define all(c) ((c).begin(),(c).end())
#define rall(c) ((c).rbegin(),(c).rend())
#define ll long long
#define fi first
#define se second
#define inf (999999999)
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
int n;
int a[100001];

 int solve(int nown,int lastnumber,int s) {
	if (nown == n) {
		return s;
	}
	if (lastnumber == 0) {
		int res=max(solve(nown + 1, a[nown], 1), solve(nown + 1, 0, 0));
		return res;
	}
	else {
		int res;
		if (a[nown] % lastnumber == 0) {
			res = max(solve(nown + 1, a[nown], s + 1), solve(nown + 1, lastnumber, s));
		}
		else {
			res = solve(nown + 1, lastnumber, s);
		}
		return res;
	}
}

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a, a + n);
	cout << solve(0,0,0) << endl;
	return 0;
}