In this

**HackerEarth Build a graph problem solution**You are given an integer n. Determine if there is an unconnected graph with n vertices that contains at least two connected components and contains the number of edges that is equal to the number of vertices. Each vertex must follow one of these conditions:- Its degree is less than or equal to 1.
- It’s a cut-vertex.

## HackerEarth Build a graph problem solution.

`a = input()`

if a < 12:

print "No"

else:

print "Yes"

### Second solution

`a = input()`

if a < 12:

print "No"

else:

print "Yes"