#include #include #include using namespace atcoder; using namespace std; using ll = long long; using mint = modint998244353; int op(int a, int b) {return min(a,b);} int inf = 1e9; int e() {return inf;} int main() { int N;cin >> N; vector A(N + 1, 0); for (int i = 1;i <= N;i++) cin >> A[i]; vector> dp(N + 1, vector(N + 1, 0)); segtree seg(A); vector L(N + 1), R(N + 1); for (int j = 1;j <= N;j++) { int ok = j; int ng = 0; while (ok - ng > 1) { int x = (ok + ng) / 2; if (seg.prod(x, j + 1) == A[j]) { ok = x; } else { ng = x; } } int l = ok; ok = j; ng = N + 1; while (ng - ok > 1) { int x = (ok + ng) / 2; if (seg.prod(j, x + 1) == A[j]) { ok = x; } else { ng = x; } } int r = ok; L[j] = l; R[j] = r; } for (int j = 0;j <= N;j++) dp[0][j] = 1; vector> S(N + 1, vector(N + 1, 0)); for (int j = 0;j <= N;j++) S[0][j] = dp[0][j]; for (int i = 1;i <= N;i++) { for (int j = 1;j <= N;j++) { int l = L[j];int r = R[j]; dp[i][j] += dp[i][j - 1]; if (i < l or r < i) continue; dp[i][j] += S[i - 1][j - 1] - (l == 1 ? 0 : S[l - 2][j - 1]); } for (int j = 0;j <= N;j++) S[i][j] = S[i - 1][j] + dp[i][j]; } cout << dp[N][N].val() << endl; }