Planar Graphs · Medium problem

$K_{3,3}$ has $9$ edges. ONE of its edges is subdivided TWICE in a row — that is, replaced by a $3$-edge path running through $2$ new internal vertices. How many edges does the resulting graph have?