Multiple Change Sum

Given an array $A$ of length $N$. There is an integer variable $X$ and a score $S$. Initially, $X = 0$ and $S = 0$. You play the following single-player game on the array $A$ for the next $N$ seconds: - In the $t$-th second ($1 \le t \le N$), you **may** choose any index $i$ such that $1 \le i \le N$ and $t \mid i$ (i.e., $i$ is a multiple of $t$). - Then, update the score $S$ as follows: