
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
Determine the largest integer  $n\geq 3$  for which the edges of the complete graph on  $n$  vertices
can be assigned pairwise distinct non-negative integers such that the edges of every triangle have numbers which form an arithmetic progression.

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