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.
k=int(input())
if k&1:
	print('YES')
	hn=(k<<1)-1
	print(hn<<1,hn*k)
	for t in range(0,hn+1,hn):
		for i in range(1,k,2):
			print(i+t,i+t+1)
		for i in range(1,k):
			for j in range(k,hn):
				print(i+t,j+t)
		for i in range(k,hn):
			print(i+t,hn+t)
	print(hn,hn<<1)
else:
	print('NO')