Walks, Paths and Connectivity · Easy problem

Three triangles are chained together: triangle $1,2,3$, then a single edge $34$ joins it to triangle $4,5,6$, then a single edge $67$ joins that to triangle $7,8,9$ (edges $12,23,31,34,45,56,64,67,78,89,97$). How many cut vertices does this graph have?