30. The number of edges in a Chinese postman tour (i.e., a tour with a minimum number of edges that starts and ends at the same vertex and visits each edge at least once) for the accompanying graph is ________.