#nullable enable #region var (_input, _iter) = (Array.Empty(), 0); T I() where T : IParsable { while (_iter >= _input.Length) (_input, _iter) = (Console.ReadLine()!.Trim().Split(' '), 0); return T.Parse(_input[_iter++], null); } #endregion const int Mod = 998244353; var n = I() + 1; var az = Enumerable.Range(0, n).Select(_ => I()).ToArray(); var uz = new long[n + 1]; var sz = new long[n + 1]; uz[0] = 1; var data = new SegmentTree(az); for (var i = 0; i < n; i++) { var a = az[i]; var u = uz[i]; var s = sz[i]; var pass = i + 1; var fail = n + 1; while (Math.Abs(pass - fail) >= 2) { var mid = (pass + fail) >> 1; var prod = data.Product(i + 1, mid); if (prod < Op.Max && a % prod == 0) pass = mid; else fail = mid; } sz[i + 1] = (sz[i + 1] + u + s) % Mod; sz[pass] = (sz[pass] + Mod - u) % Mod; uz[i + 1] = (u + s) % Mod; } var ans = uz[n - 1] + sz[n - 1]; Console.WriteLine(ans); readonly struct Op : ISegmentTreeOperator { public const long Max = long.MaxValue; public long IdentityElement => 1; public long Operation(long x, long y) { if (y >= Max / x) return Max; return x * y; } } interface ISegmentTreeOperator { TMonoid IdentityElement { get; } TMonoid Operation(TMonoid x, TMonoid y); } class SegmentTree where TOperator : struct, ISegmentTreeOperator { public int BaseSize { get; init; } protected int Height { get; init; } protected TOperator Op { get; init; } protected TMonoid[] Values { get; init; } public SegmentTree(TMonoid[] initial, TOperator op = default) { Op = op; (BaseSize, Height) = (1, 0); while (BaseSize < initial.Length) (BaseSize, Height) = (BaseSize << 1, Height + 1); var size = BaseSize << 1; Values = new TMonoid[size]; var values = Values; for (var i = 0; i < size; i++) values[i] = op.IdentityElement; for (var i = 0; i < initial.Length; i++) values[i + BaseSize] = initial[i]; for (var i = BaseSize - 1; i > 0; i--) Update(values, i); } public TMonoid Product(int l, int r) { (l, r) = (l + BaseSize, r + BaseSize); var (resL, resR) = (Op.IdentityElement, Op.IdentityElement); var values = Values; while (l < r) { if ((l & 1) == 1) resL = Op.Operation(resL, values[l++]); if ((r & 1) == 1) resR = Op.Operation(values[--r], resR); (l, r) = (l >> 1, r >> 1); } return Op.Operation(resL, resR); } public void Set(int index, TMonoid value) { var j = index + BaseSize; var values = Values; values[j] = value; while ((j >>= 1) > 0) Update(values, j); } protected void Update(TMonoid[] values, int k) { values[k] = Op.Operation(values[k << 1], values[(k << 1) + 1]); } }