Given an integer n, consider a sequence of blocks formed by consecutive positive integers starting from $1$:

• The $1^{ ext{st}}$ block contains $1$ integer: $1$

• The $2^{ ext{nd}}$ block contains the next $2$ integers: $2, 3$

• The $3^{ ext{rd}}$ block contains the next $3$ integers: $4, 5, 6$

• In general, the $k^{ ext{th}}$ block contains the next $k$ consecutive integers.

The value of each block is the product of all integers contained within it.

Return the sum of the values of the first n blocks modulo $10^9 + 7$.

Constraints:

• $1 \leq$ n $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.