An undirected graph is called *k*-regular, if the degrees of all its vertices are equal *k*. An edge of a connected graph is called a bridge, if after removing it the graph is being split into two connected components.

Build a connected undirected *k*-regular graph containing at least one bridge, or else state that such graph doesn't exist.
The single line of the input contains integer *k* (1 ≤ *k* ≤ 100) — the required degree of the vertices of the regular graph.
if int(input()) == 1:
    print("YES")
    print(2, 1)
    print(1, 2)
else:
    print("NO")