
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
Given a set of points in space, a *jump* consists of taking two points,  $P$  and  $Q,$  and replacing  $P$  with the reflection of  $P$  over  $Q$ . Find the smallest number  $n$  such that for any set of  $n$  lattice points in  $10$ -dimensional-space, it is possible to perform a finite number of jumps so that some two points coincide.

*Author: Anderson Wang*

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