Given an integer n, determine the minimum number of cuts required to divide the circle into n equal slices. A valid cut in a circle is defined as one of the following:

1. A cut is represented by a straight line that passes through the circle’s center and touches two points on its edge.

2. A cut is represented by a straight line touching one point on the circle’s edge and center.

Constraints:

• $1 \leq$ n $\leq 100$

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.