Eulerian Path Exists

Print YES if the connected undirected graph has a path using every edge exactly once, otherwise NO.

1 <= n <= 10^5