#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, a[100005], sum[100005], f[100005], st[100005][21], ans;
const int mod = 1000000007;
inline int query(int l, int r) {
	int mid = (log2(r - l + 1));
//	cout << l << " " << r << ' ' << __gcd(st[l][mid], st[r - (1 << mid) + 1][mid]) << " " << mid << "&&&&&\n";
	return __gcd(st[l][mid], st[r - (1 << mid) + 1][mid]);
}
inline void calc(int end) {
	memset(f, 0, sizeof(f));
	memset(sum, 0, sizeof(sum));
	f[0] = sum[0] = 1;
	int l, r, mid;
//	cout << end << "[]\n";
	for (int i = 1; i <= end; i++) {
		l = 1, r = i;
		while (l < r) {
			mid = (l + r) >> 1;
			if (query(mid, i) != 1) r = mid;
			else l = mid + 1;
		}
		if ((l == 1)) {
			f[i] = sum[i - 1];
		} else {
			f[i] = sum[i - 1] - sum[l - 2] + mod;
			f[i] %= mod;
		}
		sum[i] = sum[i - 1] + f[i];
		sum[i] %= mod;
//		cout << f[i] << " " << sum[i] << " " << l << "|";
	}
//	cout << endl;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		st[i][0] = a[i];
	}
	for (int i = 1; (1 << i) <= n; i++) {
		for (int j = 1; j + (1 << i) - 1 <= n; j++) {
			st[j][i] = __gcd(st[j][i - 1], st[j + (1 << (i - 1))][i - 1]);
//			cout << i << " " << j << " " << st[i][j] << "()\n";
		}
	}
	int lst = -1;
	for (int i = n + 1; i >= 2; i--) {
		if (i <= n) {
			a[1] = __gcd(a[i], a[1]);
		}
		if (a[1] == 1) break;
		if (a[1] != lst) {
			st[1][0] = a[1];
			for (int j = 1; (1 << j) <= n; j++) {
				st[1][j] = __gcd(st[1][j - 1], st[1 + (1 << (j - 1))][j - 1]);
			}
			calc(i - 1);
			lst = a[1];
		}
		ans += f[i - 1];
		ans %= mod;
	}
	cout << ans;
}