A town-planner has built an isolated city whose road network consists of $2N$ roundabouts, each connecting exactly three roads. A series of tunnels and bridges ensure that all roads in the town meet only at roundabouts. All roads are two-way, and each roundabout is oriented clockwise. 
Vlad has recently passed his driving test, and is nervous about roundabouts. He starts driving from his house, and always takes the first edit at each roundabout he encounters. It turns out his journey incluldes every road in the town in both directions before he arrives back at the starting point in the starting direction. For what values of $N$ is this possible?
1. **For odd \( N \):**

   We start by verifying that the cases \( N = 3 \) and \( N = 5 \) work. Here are two configurations that show these cases work:

   - For \( N = 3 \):
     ![N=3](https://i.stack.imgur.com/79a5B.png)
   - For \( N = 5 \):
     ![N=5](https://i.stack.imgur.com/79a5B.png)

   Next, we show that if \( N_1 \) and \( N_2 \) work, then \( N_1 + N_2 + 1 \) also works. Suppose we have two graphs \( G_1 \) and \( G_2 \), one with \( 2N_1 \) vertices and the other with \( 2N_2 \) vertices, which both work. Select two vertices \( v_1 \) and \( v_2 \) from \( G_1 \) that are connected, and two vertices \( u_1 \) and \( u_2 \) from \( G_2 \) that are connected. Add two more vertices \( w_1 \) and \( w_2 \).

   We perform the following operations:
   - Erase the edge between \( v_1 \) and \( v_2 \).
   - Erase the edge between \( u_1 \) and \( u_2 \).
   - Connect \( v_1 \) and \( w_1 \).
   - Connect \( v_2 \) and \( w_2 \).
   - Connect \( u_1 \) and \( w_1 \).
   - Connect \( u_2 \) and \( w_2 \).
   - Connect \( w_1 \) and \( w_2 \).

   From this initial configuration:
   ![Initial Configuration](https://i.stack.imgur.com/wVjVT.png)

   We reach this configuration:
   ![Final Configuration](https://i.stack.imgur.com/1chWC.png)

   A simple analysis of the trip the car will make with these new changes will confirm that this new graph works. Thus, if \( N_1 \) and \( N_2 \) work, then \( N_1 + N_2 + 1 \) also works. We have shown \( 3 \) and \( 5 \) work, so every odd \( N \) works. \(\blacksquare\)

2. **For even \( N \):**

   We show that there can be no such tour for even \( N \).

   Embed the graph in a two-dimensional surface. In order for the notion "clockwise" to be well-defined, the surface must be an orientable one. Now the number of vertices is \( 2N \) and the number of edges is \( 3N \). If a tour like the one described exists, then the embedding can be regarded as a map with a single face (that has \( 6N \) sides). But the generalization of Euler's formula,
   \[
   V - E + F = 2 - 2g,
   \]
   must hold, where \( g \) is the genus of the surface on which the graph is embedded. So we get
   \[
   2N - 3N + 1 = 2 - 2g.
   \]
   Simplifying, we have:
   \[
   1 - N = 2 - 2g \implies N - 1 = 2g - 2 \implies N = 2g - 1.
   \]
   This is a contradiction if \( N \) is even because \( 2g - 1 \) is always odd. \(\blacksquare\)

The final answer is \( \boxed{ N } \) must be odd.