
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
There are  $n\geq 3$  cities in a country and between any two cities  $A$  and  $B$ , there is either a one way road from  $A$  to  $B$ , or a one way road from  $B$  to  $A$  (but never both). Assume the roads are built such that it is possible to get from any city to any other city through these roads, and define  $d(A,B)$  to be the minimum number of roads you must go through to go from city  $A$  to  $B$ . Consider all possible ways to build the roads. Find the minimum possible average value of  $d(A,B)$  over all possible ordered pairs of distinct cities in the country.

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