remove a vertex of a 2-connected graph without break 2-connected

Question

suppose $G$ is 2-connected and $G$ is not a cycle, is it possible to prove that there exists a vertex $v$ such that $G-v$ is still 2-connected?

$G-v$ means remove $v$ from vertex and all incident edges