Yet Another Crossover Episode

You are given an integer $D$. Find an integer sequence $A_1, A_2, \ldots, A_N$ such that the following conditions are satisfied: - $1 \le N \le 10^5$ - $1 \le A_i \le 10^5$ for each valid $i$ - $\sum_{i=1}^N \sum_{j=i}^N \left( \mathrm{min}(A_i, A_{i+1}, \ldots, A_j) - \mathrm{GCD}(A_i, A_{i+1}, \ldots, A_j) \right) = D$ It can be proved that a solution always exists under the given constrai