Planar Graphs · Medium problem

A connected plane graph on $8$ vertices is a triangulation: every one of its faces, including the outer face, is bounded by exactly $3$ edges. How many faces does it have?