A Ferris wheel has $4$ gondolas, each capable of holding up to $4$ passengers. The wheel rotates counterclockwise, and each rotation costs runningCost.

You are given an integer array customers of length n, where customers[i] represents the number of new customers arriving before rotation $i + 1$. Each boarding passenger pays boardingCost.

Before each rotation, at most $4$ waiting customers board the arriving gondola. Any remaining customers stay in line. The wheel can continue to rotate after all customer groups have arrived as long as there are still customers waiting to board.

You may choose to stop rotating the wheel at any point.

Return the minimum number of rotations required to achieve the maximum possible profit. If it is impossible to achieve a strictly positive profit, return $-1$.

Constraints:

• n $==$ customers.length

• $1 \le$ n $\le 10^5$

• $0 \le$ customers[i] $\le 50$

• $1 \le$ boardingCost, runningCost $\le 100$

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.