
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
Let  $n$  be a positive integer. There are  $n$  lamps, each with a switch that changes the lamp from on to off, or from off to on, each time it is pressed. The lamps are initially all off.
You are going to press the switches in a series of rounds. In the first round, you are going to press exactly  $1$  switch; in the second round, you are going to press exactly  $2$  switches; and so on, so that in the  $k$ th round you are going to press exactly  $k$  switches. In each round you will press each switch at most once. Your goal is to finish a round with all of the lamps switched on.
Determine for which  $n$  you can achieve this goal.

Present the answer in LaTex format: \boxed{Your answer}
user