There are $n>1$ cities in Jansonland, with two-way roads joining certain pairs of cities. Janson will send a few robots one-by-one to build more roads. The robots operate as such: 1. Janson first selects an integer $k$ and a list of cities $a_0, a_1, \dots, a_k$ (cities can repeat). 2. The robot begins at $a_0$ and goes to $a_1$, then $a_2$, and so on until $a_k$. 3. When the robot goes from $a_i$ to $a_{i+1}$, if there is no road then the robot builds a road, but if there is a road then the robot destroys the road. In terms of $n$, determine the smallest constant $k$ such that Janson can always achieve a configuration such that every pair of cities has a road connecting them using no more than $k$ robots. (Proposed by Ho Janson)