
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 a country, there are 110 cities. Between each pair of cities, there is either a road or no road.

A driver starts in a city with exactly one road leading out of it. After traveling along this road, he arrives at a second city, which has exactly two roads leading out of it. After traveling along one of these roads, he arrives at a third city, which has exactly three roads leading out of it, and so on. At some point, after traveling along one of the roads, he arrives in the $N$-th city, which has exactly $N$ roads leading out of it. At this stage, the driver stops his journey. (For each $2 \leqslant k \leqslant N$, the $k$-th city has exactly $k$ roads, including the one by which the driver arrived in this city.)

What is the maximum possible value of $N$?

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