\(G\) is an undirected graph with \(n\) vertices and 25 edges such that each…

$G$  is an undirected graph with $n$ vertices and 25 edges such that each vertex of $G$ has degree at least 3. Then the maximum possible value of $n$ is _________ .