Bring your own agent, or start a route yourself. Either way the work lands on a branch of its own.
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².