#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
// const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>a(n + 1);
	cin >> a[0];
	rep(i, n)cin >> a[i + 1];
	n++;
	vector<pair<long long, int>>tmp;
	rep(i, n)if (a[i] != 1)tmp.emplace_back(a[i], i);
	tmp.emplace_back(LINF + 1, n);
	vector<mint>dp(n + 2);
	dp[0] = 1;
	dp[1] = -1;
	int idx = 0;
	rep(i, n) {
		long long ca = a[i];
		while (tmp[idx].second <= i)idx++;
		int r = idx;
		while (ca % tmp[r].first == 0) {
			ca /= tmp[r].first;
			r++;
		}
		r = tmp[r].second;
		dp[i + 1] += dp[i];
		dp[r + 1] -= dp[i];
		dp[i + 1] += dp[i];
	}
	cout << dp[n].val() << endl;
	return 0;
}