#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>

using namespace std;


int main(){
	int i, j;
	int n;
	vector<int>list;

	cin >> n;

	for (i = 0; i < n; i++) {
		int num;
		cin >> num;
		list.push_back(num);
	}

	sort(list.begin(), list.end());

	vector<vector<int>>dp(10005, vector<int>(10005, 0));
	//vector<int>dp(100005, 0);



	for (i = 0; i < n; i++) {

		dp[i][i] = max(1, dp[i][i]);

		for (j = 0; j < n; j++) {
			if (list[j] < list[i])continue;

			if (list[j] % list[i] == 0) {
				dp[i + 1][j] = max(dp[i][j], dp[i][i] + 1);
				//dp[j] = max(dp[j], dp[i] + 1);
			}
			else {
				dp[i + 1][j] = dp[i][j];
			}
		}
	}



	cout << dp[n][n-1]-1 << endl;















	getchar();
	getchar();
	return 0;
}