Planar Graphs · Superchallenge problem

A connected plane graph $G$ has the property that its dual $G^*$ is bipartite — equivalently, every face of $G$ has an even number of sides. $G$ has exactly $7$ quadrilateral faces and $3$ hexagonal faces, and no other faces. How many vertices does $G$ have?