The map of a country is in the form of a convex polygon with $n (n\geq5)$ sides, such as any 3 diagonals do not concur inside the polygon. Some of the diagonals are roads, which allow movement in both directions and the other diagonals are not roads. There are cities on the intersection points of any two diagonals inside the polygon and at least one of the two diagonals is a road. Prove that you can move from any city to any other city using at most 3 roads.