##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
CSES 1691 - Find Euler circuit.
Problem: A mailman wants to deliver mail along every street in a city exactly once and return to the post office. The city has intersections and streets. Find a valid route.
Link: CSES 1691
Constraints:
Output: A sequence of intersections forming an Euler circuit, or "IMPOSSIBLE" if none exists.
