
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
In the vertices of a regular 100-gon, 100 chips numbered $1, 2, \ldots, 100$ are placed in exactly that order in a clockwise direction. During each move, it is allowed to swap two chips placed at adjacent vertices if the numbers on these chips differ by no more than $k$. What is the smallest $k$ such that, in a series of such moves, every chip is shifted one position clockwise relative to its initial position?

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