Given a positive integer n, find the pivot integer x such that the sum of all integers from $1$ to x inclusive is equal to the sum of all integers from x to n inclusive.

Return the integer x. If no such integer exists, return $-1$. It is guaranteed that there is at most one pivot integer for any valid input.

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.