Solution:
Pick any street s and organize the intersections along s such that the intersections of the two types alternate, as in the statement of the problem.
On every other street s1, exactly one intersection has been organized, namely the one where s1 intersects s. Call this intersection I1. We want to organize the intersections along s1 such that they alternate between the two types. Note that, as I1 is already organized, we have exactly one way to organize the remaining intersections along s1.
For every street s1=s, we can apply the procedure described above. Now, we only need to show that every intersection not on s is well-organized. More precisely, this means that for every two streets s1,s2=s intersecting at s1∩s2=A, s1 is the main street on A if and only if s2 is the side street on A.
Consider also the intersections I1=s1∩s and I2=s2∩s. Now, we will define the "role" of the street t at the intersection X as "main" if this street t is the main street on X, and "side" otherwise. We will prove that the roles of s1 and s2 at A are different.
Consider the path A→I1→I2→A. Let the number of intersections between A and I1 be u1, the number of these between A and I2 be u2, and the number of these between I1 and I2 be v. Now, if we go from A to I1, we will change our role u1+1 times, as we will encounter u1+1 new intersections. Then, we will change our street from s1 to s, changing our role once more. Then, on the segment I1→I2, we have v+1 new role changes, and after that one more when we change our street from s1 to s2. The journey from I2 to A will induce u2+1 new role changes, so in total we have changed our role u1+1+1+v+1+1+u2+1=u1+v+u2+5, As we try to show that roles of s1 and s2 differ, we need to show that the number of role changes is odd, i.e. that u1+v+u2+5 is odd.
Obviously, this claim is equivalent to 2∣u1+v+u2. But u1,v and u2 count the number of intersections of the triangle AI1I2 with streets other than s,s1,s2. Since every street other than s,s1,s2 intersects the sides of AI1I2 in exactly two points, the total number of intersections is even. As a consequence, 2∣u1+v+u2 as required.