Find out if it is possible to partition the first $n$ positive integers into two non-empty disjoint sets $S_1$ and $S_2$ such that:$\mathrm{gcd}(\mathrm{sum}(S_1), \mathrm{sum}(S_2)) > 1$ 

Here $\mathrm{sum}(S)$ denotes the sum of all elements present in set $S$ and $\mathrm{gcd}$ means thegreatest common divisor.

Every integer number from $1$ to $n$ should be present in exactly one of $S_1$ or $S_2$.


-----Input-----

The only line of the input contains a single integer $n$ ($1 \le n \le 45\,000$)


-----Output-----

If such partition doesn't exist, print "No" (quotes for clarity).

Otherwise, print "Yes" (quotes for clarity), followed by two lines, describing $S_1$ and $S_2$ respectively.

Each set description starts with the set size, followed by the elements of the set in any order. Each set must be non-empty.

If there are multiple possible partitions — print any of them.


-----Examples-----
Input
1

Output
No
Input
3

Output
Yes
1 2
2 1 3 



-----Note-----

In the first example, there is no way to partition a single number into two non-empty sets, hence the answer is "No".

In the second example, the sums of the sets are $2$ and $4$ respectively. The $\mathrm{gcd}(2, 4) = 2 > 1$, hence that is one of the possible answers.

Difficulty: EASY
Tags: Mathematics

Constructive algorithms

Starter code:

Solutions:
n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	print(n // 2, end=' ')
	for i in range(2, n + 1, 2):
		print(i, end=' ')
	print()
	print(n - n // 2, end=' ')
	for i in range(1, n + 1, 2):
		print(i, end=' ')


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	s1 = [i for i in range(1, n + 1, 2)]
	s2 = [i for i in range(2, n + 1, 2)]
	print(len(s1), *s1)
	print(len(s2), *s2)


from math import gcd
from math import ceil
g = int(input())
p = 0
if g % 2 != 0:
	x1 = (2 + g - 1) / 2 - 1
	x2 = x1 * (x1 + 1)
	y1 = ceil(g / 2) / 2 * (1 + g)
	x = list(map(str, range(1, g + 1, 2)))
	y = list(map(str, range(2, g, 2)))
elif g % 2 == 0:
	x1 = (2 + g) / 2 - 1
	x2 = x1 * (x1 + 1)
	y1 = g / 2 / 2 * g
	x = list(map(str, range(1, g, 2)))
	y = list(map(str, range(2, g + 1, 2)))
if gcd(int(x2), int(y1)) > 1:
	print('Yes')
	print(' '.join([str(len(y))] + y))
	print(' '.join([str(len(x))] + x))
	p += 1
elif p != 1:
	print('No')


from math import gcd
n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	o = [i for i in range(1, n + 1, 2)]
	e = [i for i in range(2, n + 1, 2)]
	print(len(o), *o)
	print(len(e), *e)


def main():
	n = int(input())
	total_sum = n * (n + 1) // 2
	l = []
	if n in [1, 2]:
		print('No')
		return
	print('Yes')
	if n % 2 == 0:
		print(1, n // 2)
		l = []
		for i in range(1, n // 2):
			l.append(i)
		for i in range(n // 2 + 1, n + 1):
			l.append(i)
	else:
		print('1', n)
		l = []
		for i in range(1, n):
			l.append(i)
	print(len(l), end=' ')
	print(*l)
main()


n = int(input())
if not n > 2:
	print('No')
elif not (n + 1) // 2 & 1:
	print('Yes')
	print(1, 2)
	print(n - 1, 1, ' '.join([str(x) for x in range(3, n + 1)]))
else:
	print('Yes')
	print(1, n)
	print(n - 1, ' '.join([str(x) for x in range(1, n)]))


n = int(input())
if n <= 2:
	print('No')
	exit()
print('Yes')
m = n // 2
print(str(m) + ' ' + ' '.join([str(i) for i in range(1, n + 1) if i % 2 == 0]))
print(str(n - m) + ' ' + ' '.join([str(i) for i in range(n + 1) if i % 2 == 1]))


a = int(input())
b = [i for i in range(1, a + 1)]
if a <= 2:
	print('No')
else:
	x = a // 2
	if a % 2 != 0:
		x = (a + 1) // 2
	b.remove(x)
	print('Yes')
	print(1, x)
	print(a - 1, *b)


N = int(input())
if N < 3:
	print('No')
else:
	a = []
	b = []
	for n in range(1, N + 1):
		if n % 2:
			b.append(n)
		else:
			a.append(n)
	print('Yes')
	print(len(a), ' '.join(map(str, a)))
	print(len(b), ' '.join(map(str, b)))


n = int(input())
if n < 3:
	print('No')
elif n & 1:
	print('Yes')
	print(2, 1, n - 1)
	print(n - 2, *range(2, n - 1), n)
else:
	print('Yes')
	print(2, 1, n)
	print(n - 2, *range(2, n))


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	l1 = []
	l2 = []
	if n % 2:
		l1.append(n // 2 + 1)
		i = 0
		while i <= n // 2 - 1:
			l2.append(n - i)
			l2.append(i + 1)
			i += 1
	else:
		i = 0
		j = 0
		while i <= (n - 1) // 2:
			if j % 2:
				l1.append(n - i)
				l1.append(i + 1)
			else:
				l2.append(n - i)
				l2.append(i + 1)
			i += 1
			j += 1
	print(len(l1), end=' ')
	print(*l1)
	print(len(l2), end=' ')
	print(*l2)


n = int(input())
s = n * (n + 1) // 2
gcd = lambda a, b: a if b == 0 else gcd(b, a % b)
for k in range(1, n + 1):
	if s - k > 0 and gcd(s - k, k) > 1:
		print('Yes')
		print(1, k)
		p = [i for i in range(1, n + 1) if i != k]
		print(len(p), ' '.join(map(str, p)))
		break
else:
	print('No')


def gcd(x, y):
	a = min(x, y)
	b = max(x, y)
	if a < 1:
		return b
	if a == 1:
		return 1
	return gcd(a, b % a)
n = int(input())
i = 2
j = 1
k = n * (n + 1) // 2 - j
while gcd(j, k) <= 1 and i <= n:
	j += i
	i += 1
	k = n * (n + 1) // 2 - j
if min(j, k) == 0:
	print('No')
else:
	print('Yes')
	l = [i - 1]
	for p in range(1, i):
		l.append(p)
	print(*l)
	l2 = [n - i + 1]
	for r in range(i, n + 1):
		l2.append(r)
	print(*l2)


n = int(input())
s = 0
if n < 3:
	print('No')
	exit(0)
if n % 2 == 0:
	s = n // 2
else:
	s = (n + 1) // 2
print('Yes')
print(1, s)
print(n - 1, end=' ')
for i in range(1, n + 1):
	if i == s:
		continue
	else:
		print(i, end=' ')


n = int(input())
total = n * (n + 1) // 2
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	if n % 2 == 0:
		setA = {n // 2}
		setB = set(range(1, n + 1)) - setA
		print(len(setA), ' '.join(map(str, setA)))
		print(len(setB), ' '.join(map(str, setB)))
	else:
		setA = {(n + 1) // 2}
		setB = set(range(1, n + 1)) - setA
		print(len(setA), ' '.join(map(str, setA)))
		print(len(setB), ' '.join(map(str, setB)))


def solution(n):
	if n in [1, 2]:
		print('No')
		return
	else:
		print('Yes')
		if n % 2 == 0:
			print(n // 2, end=' ')
			for i in range(1, n + 1):
				if i % 2 == 0:
					print(i, end=' ')
			print('\n', end='')
			print(n // 2, end=' ')
			for i in range(1, n + 1):
				if i % 2 == 1:
					print(i, end=' ')
		else:
			print(n // 2, end=' ')
			for i in range(1, n + 1):
				if i % 2 == 0:
					print(i, end=' ')
			print('\n', end='')
			print(n // 2 + 1, end=' ')
			for i in range(1, n + 1):
				if i % 2 == 1:
					print(i, end=' ')
	return
number = int(input())
solution(number)


n = int(input())
p = list(range(1, n + 1))
tod = list(range(1, n + 1, 2))
ka = 0
pod = list(range(2, n + 1, 2))
koo = []
kol = sum(p)
if len(tod) % 2 == 0:
	print('Yes')
	tod.insert(0, len(tod))
	pod.insert(0, len(pod))
	print(*tod)
	print(*pod)
else:
	for item in tod[1:]:
		if kol % item == 0:
			ka = 1
			print('Yes')
			p.remove(item)
			p.insert(0, len(p))
			print(*p)
			print(1, item)
			break
		else:
			pass
	if ka == 0:
		print('No')


a = int(input())
if a <= 2:
	print('No')
else:
	print('Yes')
	print(2, end=' ')
	print('1 %d' % a)
	print(a - 2, end=' ')
	for i in range(2, a):
		print(i, end='')
		if not i == a - 1:
			print(' ', end='')
	print('')


def gcd(a, b):
	while b > 0:
		(a, b) = (b, a % b)
	return a
n = int(input())
s1 = []
s2 = []
odd_sum = 0
even_sum = 0
for i in range(1, n + 1):
	if i % 2:
		odd_sum += i
		s1.append(str(i))
	else:
		even_sum += i
		s2.append(str(i))
if gcd(odd_sum, even_sum) <= 1:
	print('No')
else:
	print('Yes')
	print(len(s1), ' '.join(s1))
	print(len(s2), ' '.join(s2))


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	odd = [i for i in range(1, n + 1, 2)]
	even = [i for i in range(2, n + 1, 2)]
	print(len(even), *even)
	print(len(odd), *odd)


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	(s1, s2) = (set(), set())
	for i in range(1, n + 1):
		if i % 2:
			s1.add(i)
		else:
			s2.add(i)
	print(len(s1), ' '.join((str(elem) for elem in s1)))
	print(len(s2), ' '.join((str(elem) for elem in s2)))


from math import *

def main():
	n = int(input())
	if n < 3:
		print('No')
		return
	a = []
	b = []
	for i in range(1, n + 1):
		if i % 2 == 0:
			a.append(i)
		else:
			b.append(i)
	if n % 2 != 0:
		print('Yes')
		print(len(a), *a)
		print(len(b), *b)
	elif gcd(sum(a), sum(b)) > 1:
		print('Yes')
		print(len(a), *a)
		print(len(b), *b)
	else:
		print('No')
main()


n = int(input())
sum = n * (n + 1) // 2
if n <= 2:
	print('No')
else:
	x = (n + 1) // 2
	if n % 2 == 0:
		x = n // 2
	print('Yes')
	print(1, x)
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if i != x:
			print(i, end=' ')


import math
from collections import defaultdict as dd
import heapq
n = int(input())
l = [i for i in range(1, n + 1)]
if n == 1 or n == 2:
	print('No')
else:
	(x, y) = ([], [])
	if n % 2:
		for i in range(1, n + 1):
			if i == n // 2 + 1:
				x.append(i)
			else:
				y.append(i)
	else:
		for i in range(1, n + 1):
			if i == n // 2 or i == n // 2 + 1:
				x.append(i)
			else:
				y.append(i)
	print('Yes')
	print(len(x), end=' ')
	print(*x)
	print(len(y), end=' ')
	print(*y)


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	print('1', (n + 1) // 2)
	print(n - 1, end=' ')
	x = list(range(n + 1))
	del x[0]
	del x[(n + 1) // 2 - 1]
	for i in x:
		print(i, end=' ')


n = int(input())
ans = 0
val = sum(range(1, n + 1))
if n > 1:
	for i in range(2, n + 1):
		if (val - i) % i == 0:
			ans = i
			break
if ans == 0:
	print('No')
else:
	print('Yes')
	print('1 ' + str(ans))
	ans_set = [str(x) for x in range(1, n + 1) if x != ans]
	print(str(n - 1) + ' ' + ' '.join(ans_set))


import sys

def main():
	pass

def binary(n):
	return bin(n).replace('0b', '')

def decimal(s):
	return int(s, 2)

def pow2(n):
	p = 0
	while n > 1:
		n //= 2
		p += 1
	return p

def isPrime(n):
	if n == 1:
		return False
	else:
		root = int(n ** 0.5)
		root += 1
		for i in range(2, root):
			if n % i == 0:
				return False
		return True

def lts(l):
	s = ''.join(map(str, l))
	return s

def stl(s):
	l = list(s)
	return l

def sq(a, target, arr=[]):
	s = sum(arr)
	if s == target:
		return arr
	if s >= target:
		return
	for i in range(len(a)):
		n = a[i]
		remaining = a[i + 1:]
		ans = sq(remaining, target, arr + [n])
		if ans:
			return ans

def SieveOfEratosthenes(n):
	cnt = 0
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	for p in range(2, n + 1):
		if prime[p]:
			cnt += 1
	return cnt

def nCr(n, r):
	f = math.factorial
	return f(n) // f(r) // f(n - r)
mod = int(1000000000.0) + 7

def ssinp():
	return sys.stdin.readline().strip()

def iinp():
	return int(input())

def nninp():
	return map(int, sys.stdin.readline().strip().split())

def llinp():
	return list(map(int, sys.stdin.readline().strip().split()))

def p(xyz):
	print(xyz)

def p2(a, b):
	print(a, b)
import math
n = iinp()
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	e = []
	o = []
	for i in range(1, n + 1):
		if i % 2 == 0:
			e.append(i)
		else:
			o.append(i)
	print(len(e), *e)
	print(len(o), *o)


from sys import stdin, stdout
from collections import Counter

def ai():
	return list(map(int, stdin.readline().split()))

def ei():
	return map(int, stdin.readline().split())

def ip():
	return int(stdin.readline().strip())

def op(ans):
	return stdout.write(str(ans) + '\n')
n = ip()
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	print(1, n)
	x = [i for i in range(1, n)]
	print(len(x), *x)


from math import sqrt

def is_prime(n):
	if n == 2:
		return True
	if n == 3:
		return True
	if n % 2 == 0:
		return False
	if n % 3 == 0:
		return False
	i = 5
	w = 2
	while i * i <= n:
		if n % i == 0:
			return False
		i += w
		w = 6 - w
	return True

def prime_factors(n):
	solution = set()
	step = 2 if n % 2 else 1
	for i in range(1, int(sqrt(n)) + 1, step):
		if n % i == 0:
			if is_prime(i):
				solution.add(i)
			if is_prime(n // i):
				solution.add(n // i)
	return solution
max = int(input())
if max == 1 or max == 2:
	print('No')
else:
	sum = max * (max + 1) // 2
	factors = prime_factors(sum)
	if len(factors) < 2:
		print('No')
	else:
		print('Yes')
		factors = list(factors)
		factors.sort()
		factor = factors[1]
		print(f'1 {factor}')
		solution = ' '.join([str(a) for a in range(1, max + 1) if a != factor])
		print(f'{max - 1} {solution}')


import math

def SieveOfEratosthenes(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	num = []
	for p in range(2, n + 1):
		if prime[p]:
			num.append(p)
	return num

def solve():
	n = int(input())
	amount = SieveOfEratosthenes(n)
	total = n * (n + 1) / 2
	for i in amount:
		if (total - i) % i == 0:
			a = [j for j in range(1, n + 1) if j != i]
			print('Yes')
			print(len(a), *a)
			print(1, i)
			return
	print('No')
solve()


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	l1 = [1]
	l2 = [2]
	for i in range(3, n + 1):
		if i % 2 == 0:
			l2.append(i)
		else:
			l1.append(i)
	print(len(l1), *l1)
	print(len(l2), *l2)


n = int(input())
su = n * (n + 1) // 2
if n <= 2:
	print('No')
else:
	x = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973, 10007, 10009, 10037, 10039, 10061, 10067, 10069, 10079, 10091, 10093, 10099, 10103, 10111, 10133, 10139, 10141, 10151, 10159, 10163, 10169, 10177, 10181, 10193, 10211, 10223, 10243, 10247, 10253, 10259, 10267, 10271, 10273, 10289, 10301, 10303, 10313, 10321, 10331, 10333, 10337, 10343, 10357, 10369, 10391, 10399, 10427, 10429, 10433, 10453, 10457, 10459, 10463, 10477, 10487, 10499, 10501, 10513, 10529, 10531, 10559, 10567, 10589, 10597, 10601, 10607, 10613, 10627, 10631, 10639, 10651, 10657, 10663, 10667, 10687, 10691, 10709, 10711, 10723, 10729, 10733, 10739, 10753, 10771, 10781, 10789, 10799, 10831, 10837, 10847, 10853, 10859, 10861, 10867, 10883, 10889, 10891, 10903, 10909, 10937, 10939, 10949, 10957, 10973, 10979, 10987, 10993, 11003, 11027, 11047, 11057, 11059, 11069, 11071, 11083, 11087, 11093, 11113, 11117, 11119, 11131, 11149, 11159, 11161, 11171, 11173, 11177, 11197, 11213, 11239, 11243, 11251, 11257, 11261, 11273, 11279, 11287, 11299, 11311, 11317, 11321, 11329, 11351, 11353, 11369, 11383, 11393, 11399, 11411, 11423, 11437, 11443, 11447, 11467, 11471, 11483, 11489, 11491, 11497, 11503, 11519, 11527, 11549, 11551, 11579, 11587, 11593, 11597, 11617, 11621, 11633, 11657, 11677, 11681, 11689, 11699, 11701, 11717, 11719, 11731, 11743, 11777, 11779, 11783, 11789, 11801, 11807, 11813, 11821, 11827, 11831, 11833, 11839, 11863, 11867, 11887, 11897, 11903, 11909, 11923, 11927, 11933, 11939, 11941, 11953, 11959, 11969, 11971, 11981, 11987, 12007, 12011, 12037, 12041, 12043, 12049, 12071, 12073, 12097, 12101, 12107, 12109, 12113, 12119, 12143, 12149, 12157, 12161, 12163, 12197, 12203, 12211, 12227, 12239, 12241, 12251, 12253, 12263, 12269, 12277, 12281, 12289, 12301, 12323, 12329, 12343, 12347, 12373, 12377, 12379, 12391, 12401, 12409, 12413, 12421, 12433, 12437, 12451, 12457, 12473, 12479, 12487, 12491, 12497, 12503, 12511, 12517, 12527, 12539, 12541, 12547, 12553, 12569, 12577, 12583, 12589, 12601, 12611, 12613, 12619, 12637, 12641, 12647, 12653, 12659, 12671, 12689, 12697, 12703, 12713, 12721, 12739, 12743, 12757, 12763, 12781, 12791, 12799, 12809, 12821, 12823, 12829, 12841, 12853, 12889, 12893, 12899, 12907, 12911, 12917, 12919, 12923, 12941, 12953, 12959, 12967, 12973, 12979, 12983, 13001, 13003, 13007, 13009, 13033, 13037, 13043, 13049, 13063, 13093, 13099, 13103, 13109, 13121, 13127, 13147, 13151, 13159, 13163, 13171, 13177, 13183, 13187, 13217, 13219, 13229, 13241, 13249, 13259, 13267, 13291, 13297, 13309, 13313, 13327, 13331, 13337, 13339, 13367, 13381, 13397, 13399, 13411, 13417, 13421, 13441, 13451, 13457, 13463, 13469, 13477, 13487, 13499, 13513, 13523, 13537, 13553, 13567, 13577, 13591, 13597, 13613, 13619, 13627, 13633, 13649, 13669, 13679, 13681, 13687, 13691, 13693, 13697, 13709, 13711, 13721, 13723, 13729, 13751, 13757, 13759, 13763, 13781, 13789, 13799, 13807, 13829, 13831, 13841, 13859, 13873, 13877, 13879, 13883, 13901, 13903, 13907, 13913, 13921, 13931, 13933, 13963, 13967, 13997, 13999, 14009, 14011, 14029, 14033, 14051, 14057, 14071, 14081, 14083, 14087, 14107, 14143, 14149, 14153, 14159, 14173, 14177, 14197, 14207, 14221, 14243, 14249, 14251, 14281, 14293, 14303, 14321, 14323, 14327, 14341, 14347, 14369, 14387, 14389, 14401, 14407, 14411, 14419, 14423, 14431, 14437, 14447, 14449, 14461, 14479, 14489, 14503, 14519, 14533, 14537, 14543, 14549, 14551, 14557, 14561, 14563, 14591, 14593, 14621, 14627, 14629, 14633, 14639, 14653, 14657, 14669, 14683, 14699, 14713, 14717, 14723, 14731, 14737, 14741, 14747, 14753, 14759, 14767, 14771, 14779, 14783, 14797, 14813, 14821, 14827, 14831, 14843, 14851, 14867, 14869, 14879, 14887, 14891, 14897, 14923, 14929, 14939, 14947, 14951, 14957, 14969, 14983, 15013, 15017, 15031, 15053, 15061, 15073, 15077, 15083, 15091, 15101, 15107, 15121, 15131, 15137, 15139, 15149, 15161, 15173, 15187, 15193, 15199, 15217, 15227, 15233, 15241, 15259, 15263, 15269, 15271, 15277, 15287, 15289, 15299, 15307, 15313, 15319, 15329, 15331, 15349, 15359, 15361, 15373, 15377, 15383, 15391, 15401, 15413, 15427, 15439, 15443, 15451, 15461, 15467, 15473, 15493, 15497, 15511, 15527, 15541, 15551, 15559, 15569, 15581, 15583, 15601, 15607, 15619, 15629, 15641, 15643, 15647, 15649, 15661, 15667, 15671, 15679, 15683, 15727, 15731, 15733, 15737, 15739, 15749, 15761, 15767, 15773, 15787, 15791, 15797, 15803, 15809, 15817, 15823, 15859, 15877, 15881, 15887, 15889, 15901, 15907, 15913, 15919, 15923, 15937, 15959, 15971, 15973, 15991, 16001, 16007, 16033, 16057, 16061, 16063, 16067, 16069, 16073, 16087, 16091, 16097, 16103, 16111, 16127, 16139, 16141, 16183, 16187, 16189, 16193, 16217, 16223, 16229, 16231, 16249, 16253, 16267, 16273, 16301, 16319, 16333, 16339, 16349, 16361, 16363, 16369, 16381, 16411, 16417, 16421, 16427, 16433, 16447, 16451, 16453, 16477, 16481, 16487, 16493, 16519, 16529, 16547, 16553, 16561, 16567, 16573, 16603, 16607, 16619, 16631, 16633, 16649, 16651, 16657, 16661, 16673, 16691, 16693, 16699, 16703, 16729, 16741, 16747, 16759, 16763, 16787, 16811, 16823, 16829, 16831, 16843, 16871, 16879, 16883, 16889, 16901, 16903, 16921, 16927, 16931, 16937, 16943, 16963, 16979, 16981, 16987, 16993, 17011, 17021, 17027, 17029, 17033, 17041, 17047, 17053, 17077, 17093, 17099, 17107, 17117, 17123, 17137, 17159, 17167, 17183, 17189, 17191, 17203, 17207, 17209, 17231, 17239, 17257, 17291, 17293, 17299, 17317, 17321, 17327, 17333, 17341, 17351, 17359, 17377, 17383, 17387, 17389, 17393, 17401, 17417, 17419, 17431, 17443, 17449, 17467, 17471, 17477, 17483, 17489, 17491, 17497, 17509, 17519, 17539, 17551, 17569, 17573, 17579, 17581, 17597, 17599, 17609, 17623, 17627, 17657, 17659, 17669, 17681, 17683, 17707, 17713, 17729, 17737, 17747, 17749, 17761, 17783, 17789, 17791, 17807, 17827, 17837, 17839, 17851, 17863, 17881, 17891, 17903, 17909, 17911, 17921, 17923, 17929, 17939, 17957, 17959, 17971, 17977, 17981, 17987, 17989, 18013, 18041, 18043, 18047, 18049, 18059, 18061, 18077, 18089, 18097, 18119, 18121, 18127, 18131, 18133, 18143, 18149, 18169, 18181, 18191, 18199, 18211, 18217, 18223, 18229, 18233, 18251, 18253, 18257, 18269, 18287, 18289, 18301, 18307, 18311, 18313, 18329, 18341, 18353, 18367, 18371, 18379, 18397, 18401, 18413, 18427, 18433, 18439, 18443, 18451, 18457, 18461, 18481, 18493, 18503, 18517, 18521, 18523, 18539, 18541, 18553, 18583, 18587, 18593, 18617, 18637, 18661, 18671, 18679, 18691, 18701, 18713, 18719, 18731, 18743, 18749, 18757, 18773, 18787, 18793, 18797, 18803, 18839, 18859, 18869, 18899, 18911, 18913, 18917, 18919, 18947, 18959, 18973, 18979, 19001, 19009, 19013, 19031, 19037, 19051, 19069, 19073, 19079, 19081, 19087, 19121, 19139, 19141, 19157, 19163, 19181, 19183, 19207, 19211, 19213, 19219, 19231, 19237, 19249, 19259, 19267, 19273, 19289, 19301, 19309, 19319, 19333, 19373, 19379, 19381, 19387, 19391, 19403, 19417, 19421, 19423, 19427, 19429, 19433, 19441, 19447, 19457, 19463, 19469, 19471, 19477, 19483, 19489, 19501, 19507, 19531, 19541, 19543, 19553, 19559, 19571, 19577, 19583, 19597, 19603, 19609, 19661, 19681, 19687, 19697, 19699, 19709, 19717, 19727, 19739, 19751, 19753, 19759, 19763, 19777, 19793, 19801, 19813, 19819, 19841, 19843, 19853, 19861, 19867, 19889, 19891, 19913, 19919, 19927, 19937, 19949, 19961, 19963, 19973, 19979, 19991, 19993, 19997, 20011, 20021, 20023, 20029, 20047, 20051, 20063, 20071, 20089, 20101, 20107, 20113, 20117, 20123, 20129, 20143, 20147, 20149, 20161, 20173, 20177, 20183, 20201, 20219, 20231, 20233, 20249, 20261, 20269, 20287, 20297, 20323, 20327, 20333, 20341, 20347, 20353, 20357, 20359, 20369, 20389, 20393, 20399, 20407, 20411, 20431, 20441, 20443, 20477, 20479, 20483, 20507, 20509, 20521, 20533, 20543, 20549, 20551, 20563, 20593, 20599, 20611, 20627, 20639, 20641, 20663, 20681, 20693, 20707, 20717, 20719, 20731, 20743, 20747, 20749, 20753, 20759, 20771, 20773, 20789, 20807, 20809, 20849, 20857, 20873, 20879, 20887, 20897, 20899, 20903, 20921, 20929, 20939, 20947, 20959, 20963, 20981, 20983, 21001, 21011, 21013, 21017, 21019, 21023, 21031, 21059, 21061, 21067, 21089, 21101, 21107, 21121, 21139, 21143, 21149, 21157, 21163, 21169, 21179, 21187, 21191, 21193, 21211, 21221, 21227, 21247, 21269, 21277, 21283, 21313, 21317, 21319, 21323, 21341, 21347, 21377, 21379, 21383, 21391, 21397, 21401, 21407, 21419, 21433, 21467, 21481, 21487, 21491, 21493, 21499, 21503, 21517, 21521, 21523, 21529, 21557, 21559, 21563, 21569, 21577, 21587, 21589, 21599, 21601, 21611, 21613, 21617, 21647, 21649, 21661, 21673, 21683, 21701, 21713, 21727, 21737, 21739, 21751, 21757, 21767, 21773, 21787, 21799, 21803, 21817, 21821, 21839, 21841, 21851, 21859, 21863, 21871, 21881, 21893, 21911, 21929, 21937, 21943, 21961, 21977, 21991, 21997, 22003, 22013, 22027, 22031, 22037, 22039, 22051, 22063, 22067, 22073, 22079, 22091, 22093, 22109, 22111, 22123, 22129, 22133, 22147, 22153, 22157, 22159, 22171, 22189, 22193, 22229, 22247, 22259, 22271, 22273, 22277, 22279, 22283, 22291, 22303, 22307, 22343, 22349, 22367, 22369, 22381, 22391, 22397, 22409, 22433, 22441, 22447, 22453, 22469, 22481, 22483, 22501, 22511, 22531, 22541, 22543, 22549, 22567, 22571, 22573, 22613, 22619, 22621, 22637, 22639, 22643, 22651, 22669, 22679, 22691, 22697, 22699, 22709, 22717, 22721, 22727, 22739, 22741, 22751, 22769, 22777, 22783, 22787, 22807, 22811, 22817, 22853, 22859, 22861, 22871, 22877, 22901, 22907, 22921, 22937, 22943, 22961, 22963, 22973, 22993, 23003, 23011, 23017, 23021, 23027, 23029, 23039, 23041, 23053, 23057, 23059, 23063, 23071, 23081, 23087, 23099, 23117, 23131, 23143, 23159, 23167, 23173, 23189, 23197, 23201, 23203, 23209, 23227, 23251, 23269, 23279, 23291, 23293, 23297, 23311, 23321, 23327, 23333, 23339, 23357, 23369, 23371, 23399, 23417, 23431, 23447, 23459, 23473, 23497, 23509, 23531, 23537, 23539, 23549, 23557, 23561, 23563, 23567, 23581, 23593, 23599, 23603, 23609, 23623, 23627, 23629, 23633, 23663, 23669, 23671, 23677, 23687, 23689, 23719, 23741, 23743, 23747, 23753, 23761, 23767, 23773, 23789, 23801, 23813, 23819, 23827, 23831, 23833, 23857, 23869, 23873, 23879, 23887, 23893, 23899, 23909, 23911, 23917, 23929, 23957, 23971, 23977, 23981, 23993, 24001, 24007, 24019, 24023, 24029, 24043, 24049, 24061, 24071, 24077, 24083, 24091, 24097, 24103, 24107, 24109, 24113, 24121, 24133, 24137, 24151, 24169, 24179, 24181, 24197, 24203, 24223, 24229, 24239, 24247, 24251, 24281, 24317, 24329, 24337, 24359, 24371, 24373, 24379, 24391, 24407, 24413, 24419, 24421, 24439, 24443, 24469, 24473, 24481, 24499, 24509, 24517, 24527, 24533, 24547, 24551, 24571, 24593, 24611, 24623, 24631, 24659, 24671, 24677, 24683, 24691, 24697, 24709, 24733, 24749, 24763, 24767, 24781, 24793, 24799, 24809, 24821, 24841, 24847, 24851, 24859, 24877, 24889, 24907, 24917, 24919, 24923, 24943, 24953, 24967, 24971, 24977, 24979, 24989, 25013, 25031, 25033, 25037, 25057, 25073, 25087, 25097, 25111, 25117, 25121, 25127, 25147, 25153, 25163, 25169, 25171, 25183, 25189, 25219, 25229, 25237, 25243, 25247, 25253, 25261, 25301, 25303, 25307, 25309, 25321, 25339, 25343, 25349, 25357, 25367, 25373, 25391, 25409, 25411, 25423, 25439, 25447, 25453, 25457, 25463, 25469, 25471, 25523, 25537, 25541, 25561, 25577, 25579, 25583, 25589, 25601, 25603, 25609, 25621, 25633, 25639, 25643, 25657, 25667, 25673, 25679, 25693, 25703, 25717, 25733, 25741, 25747, 25759, 25763, 25771, 25793, 25799, 25801, 25819, 25841, 25847, 25849, 25867, 25873, 25889, 25903, 25913, 25919, 25931, 25933, 25939, 25943, 25951, 25969, 25981, 25997, 25999, 26003, 26017, 26021, 26029, 26041, 26053, 26083, 26099, 26107, 26111, 26113, 26119, 26141, 26153, 26161, 26171, 26177, 26183, 26189, 26203, 26209, 26227, 26237, 26249, 26251, 26261, 26263, 26267, 26293, 26297, 26309, 26317, 26321, 26339, 26347, 26357, 26371, 26387, 26393, 26399, 26407, 26417, 26423, 26431, 26437, 26449, 26459, 26479, 26489, 26497, 26501, 26513, 26539, 26557, 26561, 26573, 26591, 26597, 26627, 26633, 26641, 26647, 26669, 26681, 26683, 26687, 26693, 26699, 26701, 26711, 26713, 26717, 26723, 26729, 26731, 26737, 26759, 26777, 26783, 26801, 26813, 26821, 26833, 26839, 26849, 26861, 26863, 26879, 26881, 26891, 26893, 26903, 26921, 26927, 26947, 26951, 26953, 26959, 26981, 26987, 26993, 27011, 27017, 27031, 27043, 27059, 27061, 27067, 27073, 27077, 27091, 27103, 27107, 27109, 27127, 27143, 27179, 27191, 27197, 27211, 27239, 27241, 27253, 27259, 27271, 27277, 27281, 27283, 27299, 27329, 27337, 27361, 27367, 27397, 27407, 27409, 27427, 27431, 27437, 27449, 27457, 27479, 27481, 27487, 27509, 27527, 27529, 27539, 27541, 27551, 27581, 27583, 27611, 27617, 27631, 27647, 27653, 27673, 27689, 27691, 27697, 27701, 27733, 27737, 27739, 27743, 27749, 27751, 27763, 27767, 27773, 27779, 27791, 27793, 27799, 27803, 27809, 27817, 27823, 27827, 27847, 27851, 27883, 27893, 27901, 27917, 27919, 27941, 27943, 27947, 27953, 27961, 27967, 27983, 27997, 28001, 28019, 28027, 28031, 28051, 28057, 28069, 28081, 28087, 28097, 28099, 28109, 28111, 28123, 28151, 28163, 28181, 28183, 28201, 28211, 28219, 28229, 28277, 28279, 28283, 28289, 28297, 28307, 28309, 28319, 28349, 28351, 28387, 28393, 28403, 28409, 28411, 28429, 28433, 28439, 28447, 28463, 28477, 28493, 28499, 28513, 28517, 28537, 28541, 28547, 28549, 28559, 28571, 28573, 28579, 28591, 28597, 28603, 28607, 28619, 28621, 28627, 28631, 28643, 28649, 28657, 28661, 28663, 28669, 28687, 28697, 28703, 28711, 28723, 28729, 28751, 28753, 28759, 28771, 28789, 28793, 28807, 28813, 28817, 28837, 28843, 28859, 28867, 28871, 28879, 28901, 28909, 28921, 28927, 28933, 28949, 28961, 28979, 29009, 29017, 29021, 29023, 29027, 29033, 29059, 29063, 29077, 29101, 29123, 29129, 29131, 29137, 29147, 29153, 29167, 29173, 29179, 29191, 29201, 29207, 29209, 29221, 29231, 29243, 29251, 29269, 29287, 29297, 29303, 29311, 29327, 29333, 29339, 29347, 29363, 29383, 29387, 29389, 29399, 29401, 29411, 29423, 29429, 29437, 29443, 29453, 29473, 29483, 29501, 29527, 29531, 29537, 29567, 29569, 29573, 29581, 29587, 29599, 29611, 29629, 29633, 29641, 29663, 29669, 29671, 29683, 29717, 29723, 29741, 29753, 29759, 29761, 29789, 29803, 29819, 29833, 29837, 29851, 29863, 29867, 29873, 29879, 29881, 29917, 29921, 29927, 29947, 29959, 29983, 29989, 30011, 30013, 30029, 30047, 30059, 30071, 30089, 30091, 30097, 30103, 30109, 30113, 30119, 30133, 30137, 30139, 30161, 30169, 30181, 30187, 30197, 30203, 30211, 30223, 30241, 30253, 30259, 30269, 30271, 30293, 30307, 30313, 30319, 30323, 30341, 30347, 30367, 30389, 30391, 30403, 30427, 30431, 30449, 30467, 30469, 30491, 30493, 30497, 30509, 30517, 30529, 30539, 30553, 30557, 30559, 30577, 30593, 30631, 30637, 30643, 30649, 30661, 30671, 30677, 30689, 30697, 30703, 30707, 30713, 30727, 30757, 30763, 30773, 30781, 30803, 30809, 30817, 30829, 30839, 30841, 30851, 30853, 30859, 30869, 30871, 30881, 30893, 30911, 30931, 30937, 30941, 30949, 30971, 30977, 30983, 31013, 31019, 31033, 31039, 31051, 31063, 31069, 31079, 31081, 31091, 31121, 31123, 31139, 31147, 31151, 31153, 31159, 31177, 31181, 31183, 31189, 31193, 31219, 31223, 31231, 31237, 31247, 31249, 31253, 31259, 31267, 31271, 31277, 31307, 31319, 31321, 31327, 31333, 31337, 31357, 31379, 31387, 31391, 31393, 31397, 31469, 31477, 31481, 31489, 31511, 31513, 31517, 31531, 31541, 31543, 31547, 31567, 31573, 31583, 31601, 31607, 31627, 31643, 31649, 31657, 31663, 31667, 31687, 31699, 31721, 31723, 31727, 31729, 31741, 31751, 31769, 31771, 31793, 31799, 31817, 31847, 31849, 31859, 31873, 31883, 31891, 31907, 31957, 31963, 31973, 31981, 31991, 32003, 32009, 32027, 32029, 32051, 32057, 32059, 32063, 32069, 32077, 32083, 32089, 32099, 32117, 32119, 32141, 32143, 32159, 32173, 32183, 32189, 32191, 32203, 32213, 32233, 32237, 32251, 32257, 32261, 32297, 32299, 32303, 32309, 32321, 32323, 32327, 32341, 32353, 32359, 32363, 32369, 32371, 32377, 32381, 32401, 32411, 32413, 32423, 32429, 32441, 32443, 32467, 32479, 32491, 32497, 32503, 32507, 32531, 32533, 32537, 32561, 32563, 32569, 32573, 32579, 32587, 32603, 32609, 32611, 32621, 32633, 32647, 32653, 32687, 32693, 32707, 32713, 32717, 32719, 32749, 32771, 32779, 32783, 32789, 32797, 32801, 32803, 32831, 32833, 32839, 32843, 32869, 32887, 32909, 32911, 32917, 32933, 32939, 32941, 32957, 32969, 32971, 32983, 32987, 32993, 32999, 33013, 33023, 33029, 33037, 33049, 33053, 33071, 33073, 33083, 33091, 33107, 33113, 33119, 33149, 33151, 33161, 33179, 33181, 33191, 33199, 33203, 33211, 33223, 33247, 33287, 33289, 33301, 33311, 33317, 33329, 33331, 33343, 33347, 33349, 33353, 33359, 33377, 33391, 33403, 33409, 33413, 33427, 33457, 33461, 33469, 33479, 33487, 33493, 33503, 33521, 33529, 33533, 33547, 33563, 33569, 33577, 33581, 33587, 33589, 33599, 33601, 33613, 33617, 33619, 33623, 33629, 33637, 33641, 33647, 33679, 33703, 33713, 33721, 33739, 33749, 33751, 33757, 33767, 33769, 33773, 33791, 33797, 33809, 33811, 33827, 33829, 33851, 33857, 33863, 33871, 33889, 33893, 33911, 33923, 33931, 33937, 33941, 33961, 33967, 33997, 34019, 34031, 34033, 34039, 34057, 34061, 34123, 34127, 34129, 34141, 34147, 34157, 34159, 34171, 34183, 34211, 34213, 34217, 34231, 34253, 34259, 34261, 34267, 34273, 34283, 34297, 34301, 34303, 34313, 34319, 34327, 34337, 34351, 34361, 34367, 34369, 34381, 34403, 34421, 34429, 34439, 34457, 34469, 34471, 34483, 34487, 34499, 34501, 34511, 34513, 34519, 34537, 34543, 34549, 34583, 34589, 34591, 34603, 34607, 34613, 34631, 34649, 34651, 34667, 34673, 34679, 34687, 34693, 34703, 34721, 34729, 34739, 34747, 34757, 34759, 34763, 34781, 34807, 34819, 34841, 34843, 34847, 34849, 34871, 34877, 34883, 34897, 34913, 34919, 34939, 34949, 34961, 34963, 34981, 35023, 35027, 35051, 35053, 35059, 35069, 35081, 35083, 35089, 35099, 35107, 35111, 35117, 35129, 35141, 35149, 35153, 35159, 35171, 35201, 35221, 35227, 35251, 35257, 35267, 35279, 35281, 35291, 35311, 35317, 35323, 35327, 35339, 35353, 35363, 35381, 35393, 35401, 35407, 35419, 35423, 35437, 35447, 35449, 35461, 35491, 35507, 35509, 35521, 35527, 35531, 35533, 35537, 35543, 35569, 35573, 35591, 35593, 35597, 35603, 35617, 35671, 35677, 35729, 35731, 35747, 35753, 35759, 35771, 35797, 35801, 35803, 35809, 35831, 35837, 35839, 35851, 35863, 35869, 35879, 35897, 35899, 35911, 35923, 35933, 35951, 35963, 35969, 35977, 35983, 35993, 35999, 36007, 36011, 36013, 36017, 36037, 36061, 36067, 36073, 36083, 36097, 36107, 36109, 36131, 36137, 36151, 36161, 36187, 36191, 36209, 36217, 36229, 36241, 36251, 36263, 36269, 36277, 36293, 36299, 36307, 36313, 36319, 36341, 36343, 36353, 36373, 36383, 36389, 36433, 36451, 36457, 36467, 36469, 36473, 36479, 36493, 36497, 36523, 36527, 36529, 36541, 36551, 36559, 36563, 36571, 36583, 36587, 36599, 36607, 36629, 36637, 36643, 36653, 36671, 36677, 36683, 36691, 36697, 36709, 36713, 36721, 36739, 36749, 36761, 36767, 36779, 36781, 36787, 36791, 36793, 36809, 36821, 36833, 36847, 36857, 36871, 36877, 36887, 36899, 36901, 36913, 36919, 36923, 36929, 36931, 36943, 36947, 36973, 36979, 36997, 37003, 37013, 37019, 37021, 37039, 37049, 37057, 37061, 37087, 37097, 37117, 37123, 37139, 37159, 37171, 37181, 37189, 37199, 37201, 37217, 37223, 37243, 37253, 37273, 37277, 37307, 37309, 37313, 37321, 37337, 37339, 37357, 37361, 37363, 37369, 37379, 37397, 37409, 37423, 37441, 37447, 37463, 37483, 37489, 37493, 37501, 37507, 37511, 37517, 37529, 37537, 37547, 37549, 37561, 37567, 37571, 37573, 37579, 37589, 37591, 37607, 37619, 37633, 37643, 37649, 37657, 37663, 37691, 37693, 37699, 37717, 37747, 37781, 37783, 37799, 37811, 37813, 37831, 37847, 37853, 37861, 37871, 37879, 37889, 37897, 37907, 37951, 37957, 37963, 37967, 37987, 37991, 37993, 37997, 38011, 38039, 38047, 38053, 38069, 38083, 38113, 38119, 38149, 38153, 38167, 38177, 38183, 38189, 38197, 38201, 38219, 38231, 38237, 38239, 38261, 38273, 38281, 38287, 38299, 38303, 38317, 38321, 38327, 38329, 38333, 38351, 38371, 38377, 38393, 38431, 38447, 38449, 38453, 38459, 38461, 38501, 38543, 38557, 38561, 38567, 38569, 38593, 38603, 38609, 38611, 38629, 38639, 38651, 38653, 38669, 38671, 38677, 38693, 38699, 38707, 38711, 38713, 38723, 38729, 38737, 38747, 38749, 38767, 38783, 38791, 38803, 38821, 38833, 38839, 38851, 38861, 38867, 38873, 38891, 38903, 38917, 38921, 38923, 38933, 38953, 38959, 38971, 38977, 38993, 39019, 39023, 39041, 39043, 39047, 39079, 39089, 39097, 39103, 39107, 39113, 39119, 39133, 39139, 39157, 39161, 39163, 39181, 39191, 39199, 39209, 39217, 39227, 39229, 39233, 39239, 39241, 39251, 39293, 39301, 39313, 39317, 39323, 39341, 39343, 39359, 39367, 39371, 39373, 39383, 39397, 39409, 39419, 39439, 39443, 39451, 39461, 39499, 39503, 39509, 39511, 39521, 39541, 39551, 39563, 39569, 39581, 39607, 39619, 39623, 39631, 39659, 39667, 39671, 39679, 39703, 39709, 39719, 39727, 39733, 39749, 39761, 39769, 39779, 39791, 39799, 39821, 39827, 39829, 39839, 39841, 39847, 39857, 39863, 39869, 39877, 39883, 39887, 39901, 39929, 39937, 39953, 39971, 39979, 39983, 39989, 40009, 40013, 40031, 40037, 40039, 40063, 40087, 40093, 40099, 40111, 40123, 40127, 40129, 40151, 40153, 40163, 40169, 40177, 40189, 40193, 40213, 40231, 40237, 40241, 40253, 40277, 40283, 40289, 40343, 40351, 40357, 40361, 40387, 40423, 40427, 40429, 40433, 40459, 40471, 40483, 40487, 40493, 40499, 40507, 40519, 40529, 40531, 40543, 40559, 40577, 40583, 40591, 40597, 40609, 40627, 40637, 40639, 40693, 40697, 40699, 40709, 40739, 40751, 40759, 40763, 40771, 40787, 40801, 40813, 40819, 40823, 40829, 40841, 40847, 40849, 40853, 40867, 40879, 40883, 40897, 40903, 40927, 40933, 40939, 40949, 40961, 40973, 40993, 41011, 41017, 41023, 41039, 41047, 41051, 41057, 41077, 41081, 41113, 41117, 41131, 41141, 41143, 41149, 41161, 41177, 41179, 41183, 41189, 41201, 41203, 41213, 41221, 41227, 41231, 41233, 41243, 41257, 41263, 41269, 41281, 41299, 41333, 41341, 41351, 41357, 41381, 41387, 41389, 41399, 41411, 41413, 41443, 41453, 41467, 41479, 41491, 41507, 41513, 41519, 41521, 41539, 41543, 41549, 41579, 41593, 41597, 41603, 41609, 41611, 41617, 41621, 41627, 41641, 41647, 41651, 41659, 41669, 41681, 41687, 41719, 41729, 41737, 41759, 41761, 41771, 41777, 41801, 41809, 41813, 41843, 41849, 41851, 41863, 41879, 41887, 41893, 41897, 41903, 41911, 41927, 41941, 41947, 41953, 41957, 41959, 41969, 41981, 41983, 41999, 42013, 42017, 42019, 42023, 42043, 42061, 42071, 42073, 42083, 42089, 42101, 42131, 42139, 42157, 42169, 42179, 42181, 42187, 42193, 42197, 42209, 42221, 42223, 42227, 42239, 42257, 42281, 42283, 42293, 42299, 42307, 42323, 42331, 42337, 42349, 42359, 42373, 42379, 42391, 42397, 42403, 42407, 42409, 42433, 42437, 42443, 42451, 42457, 42461, 42463, 42467, 42473, 42487, 42491, 42499, 42509, 42533, 42557, 42569, 42571, 42577, 42589, 42611, 42641, 42643, 42649, 42667, 42677, 42683, 42689, 42697, 42701, 42703, 42709, 42719, 42727, 42737, 42743, 42751, 42767, 42773, 42787, 42793, 42797, 42821, 42829, 42839, 42841, 42853, 42859, 42863, 42899, 42901, 42923, 42929, 42937, 42943, 42953, 42961, 42967, 42979, 42989, 43003, 43013, 43019, 43037, 43049, 43051, 43063, 43067, 43093, 43103, 43117, 43133, 43151, 43159, 43177, 43189, 43201, 43207, 43223, 43237, 43261, 43271, 43283, 43291, 43313, 43319, 43321, 43331, 43391, 43397, 43399, 43403, 43411, 43427, 43441, 43451, 43457, 43481, 43487, 43499, 43517, 43541, 43543, 43573, 43577, 43579, 43591, 43597, 43607, 43609, 43613, 43627, 43633, 43649, 43651, 43661, 43669, 43691, 43711, 43717, 43721, 43753, 43759, 43777, 43781, 43783, 43787, 43789, 43793, 43801, 43853, 43867, 43889, 43891, 43913, 43933, 43943, 43951, 43961, 43963, 43969, 43973, 43987, 43991, 43997, 44017, 44021, 44027, 44029, 44041, 44053, 44059, 44071, 44087, 44089, 44101, 44111, 44119, 44123, 44129, 44131, 44159, 44171, 44179, 44189, 44201, 44203, 44207, 44221, 44249, 44257, 44263, 44267, 44269, 44273, 44279, 44281, 44293, 44351, 44357, 44371, 44381, 44383, 44389, 44417, 44449, 44453, 44483, 44491, 44497, 44501, 44507, 44519, 44531, 44533, 44537, 44543, 44549, 44563, 44579, 44587, 44617, 44621, 44623, 44633, 44641, 44647, 44651, 44657, 44683, 44687, 44699, 44701, 44711, 44729, 44741, 44753, 44771, 44773, 44777, 44789, 44797, 44809, 44819, 44839, 44843, 44851, 44867, 44879, 44887, 44893, 44909, 44917, 44927, 44939, 44953, 44959, 44963, 44971, 44983, 44987]
	flag = 1
	i = 0
	c = 0
	while flag:
		if su % x[i] == 0:
			flag = 0
			c = x[i]
		i += 1
	if i + 1 == len(x):
		print('No')
	else:
		print('Yes')
		print(1, c)
		print(n - 1, end=' ')
		for j in range(n):
			if j + 1 == c:
				continue
			else:
				print(j + 1, end=' ')


def gcd(a, b):
	if b == 0:
		return a
	return gcd(a, a % b)
n = int(input())
if n <= 2:
	print('No')
else:
	even = []
	odd = []
	for i in range(1, n + 1):
		if i % 2 == 1:
			odd.append(i)
		else:
			even.append(i)
	if n % 2 == 1:
		print('Yes')
		print(1, end=' ')
		print(n)
		print(n - 1, end=' ')
		for i in range(1, n):
			print(i, end=' ')
		print()
	else:
		print('Yes')
		print(len(even), end=' ')
		for i in range(len(even)):
			print(even[i], end=' ')
		print()
		print(len(odd), end=' ')
		for i in range(len(odd)):
			print(odd[i], end=' ')
		print()


n = int(input())
if n % 2 == 0:
	k = int(n / 2)
else:
	k = int((n + 1) / 2)
if n <= 2:
	print('No')
else:
	print('Yes')
	print(1, k)
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if i == k:
			pass
		else:
			print(i, end=' ')


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	k = n // 2
	if n % 2 != 0:
		k += 1
	set1 = [k]
	set2 = []
	for i in range(1, n + 1):
		if i != k:
			set2.append(i)
	print(len(set1), *set1)
	print(len(set2), *set2)


from math import gcd
N = int(input())
Sum = N * (N + 1) // 2
if N in [1, 2]:
	print('No')
	exit()
for i in range(2, N):
	if (Sum - i) % i == 0:
		print('Yes')
		print(1, i)
		print(N - 1, end=' ')
		Temp = list(range(1, N))
		Temp[i - 1] = N
		print(*Temp)
		exit()
print('No')


n = int(input())
if n <= 2:
	print('No')
	exit(0)
print('Yes')
if n % 2 == 1:
	print(1, n)
	print(n - 1, ' '.join(list(map(str, range(1, n)))))
else:
	print(1, n // 2)
	print(n - 1, end=' ')
	for i in range(n):
		if i + 1 == n / 2:
			continue
		print(i + 1, end=' ')


def main():
	n = int(input())
	(s, c) = (n * (n + 1) // 2, 2)
	while c * c <= s:
		if not s % c:
			print('Yes')
			print(1, c)
			print(n - 1, end=' ')
			print(' '.join([str(i) for i in range(1, n + 1) if i != c]))
			exit()
		c += 1
	print('No')
main()


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes', '\n', 1, n, '\n', n - 1, end=' ')
	for i in range(1, n):
		print(i, end=' ')


n = int(input())
if n < 3:
	print('No')
else:
	k = (n + 1) // 2
	print('Yes')
	print(1, k)
	print(n - 1, *set(range(1, n + 1)) - {k})


def Foo():
	str = ''
	for i in range(2, a):
		str += '{} '.format(i)
	return str

def Foo2():
	str = ''
	for i in range(1, a):
		str += '{} '.format(i)
	return str
a = int(input())
if a < 3:
	print('No')
else:
	print('Yes')
	if a % 2 == 0:
		print('1 {}\n{} {}'.format(a, a - 1, Foo2()))
	else:
		print('2 1 {}\n{} {}'.format(a, a - 2, Foo()))


import math
from collections import defaultdict, Counter, deque
INF = float('inf')

def gcd(a, b):
	while b:
		(a, b) = (b, a % b)
	return a

def primeFactor(n):
	if n % 2 == 0:
		return 2
	i = 3
	while i ** 2 <= n:
		if n % i == 0:
			return i
		i += 1
	return n

def main():
	n = int(input())
	if n == 1 or n == 2:
		print('No')
	else:
		print('Yes')
		s1 = []
		s2 = []
		for i in range(1, n + 1):
			if i % 2 == 0:
				s1.append(i)
			else:
				s2.append(i)
		print(len(s1), *s1)
		print(len(s2), *s2)
t = 1
for _ in range(t):
	main()


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	even = []
	odd = []
	for i in range(1, n + 1):
		if i % 2 == 0:
			even.append(i)
		else:
			odd.append(i)
	print('Yes')
	print(str(len(even)) + ' ', end='')
	print(*even)
	print(str(len(odd)) + ' ', end='')
	print(*odd)


x = int(input())
if x > 3:
	if x % 2 == 1:
		print('Yes')
		print(x - 3, end=' ')
		for i in range(2, x - 1):
			if i == x:
				print(i)
				break
			print(i, end=' ')
		print(3, x, x - 1, 1)
	elif x % 2 == 0:
		print('Yes')
		print(x - 2, end=' ')
		for i in range(2, x):
			if i == x - 1:
				print(i)
				break
			print(i, end=' ')
		print(2, x, 1)
else:
	if x == 1:
		print('No')
	if x == 2:
		print('No')
	if x == 3:
		print('Yes')
		print(1, 2)
		print(2, 1, 3)


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	print(1, n)
	print(n - 1, *range(1, n))


n = int(input())
if n == 1 or n == 2:
	print('No')
	raise SystemExit
print('Yes')
if n % 2 == 0:
	print(1, int(n / 2))
	print(n - 1, ' '.join([str(i) for i in range(1, n + 1) if i != n / 2]))
else:
	print(1, int((n - 1) / 2 + 1))
	print(n - 1, ' '.join([str(i) for i in range(1, n + 1) if i != (n - 1) / 2 + 1]))


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	S0 = []
	S1 = []
	switch = True
	while n > 0:
		if switch:
			S0.append(n)
		else:
			S1.append(n)
		n -= 1
		switch = not switch
	print(str(len(S0)) + ' ' + ' '.join([str(x) for x in S0]))
	print(str(len(S1)) + ' ' + ' '.join([str(x) for x in S1]))


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	print(n - 1, str([i for i in range(1, n)]).replace(',', '').replace('[', '').replace(']', ''), sep=' ')
	print(1, n)


def mi():
	return map(int, input().split())
n = int(input())
odd = []
even = []
if n % 2:
	if n == 1:
		print('No')
	else:
		print('Yes')
		for i in range(1, n + 1):
			if i % 2:
				odd.append(i)
		print(len(odd), *odd)
		for i in range(1, n + 1):
			if i % 2 == 0:
				even.append(i)
		print(len(even), *even)
elif n == 2:
	print('No')
else:
	print('Yes')
	for i in range(1, n + 1):
		if i % 2:
			odd.append(i)
	print(len(odd), *odd)
	for i in range(1, n + 1):
		if i % 2 == 0:
			even.append(i)
	print(len(even), *even)


n = int(input())
a = []
b = []
for i in range(1, n + 1):
	if i % 2 == 0:
		a.append(i)
	else:
		b.append(i)
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	print(len(a), *a)
	print(len(b), *b)


n = int(input().strip())
if n <= 2:
	print('No')
else:
	print('Yes')
	(s1, s2) = ([], [])
	for i in range(1, n + 1):
		if i % 2 == 0:
			s1.append(i)
		else:
			s2.append(i)
	print(len(s1), *s1)
	print(len(s2), *s2)


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	sum = (n + 1) * n / 2
	if sum % 2 == 0:
		print('1 2')
		anotherLine = '%d 1' % (n - 1)
		for i in range(3, n + 1):
			anotherLine += ' %d' % i
		print(anotherLine)
	else:
		if n % 2 == 0:
			middle = n / 2
		else:
			middle = (n + 1) / 2
		print('1 %d' % middle)
		anotherLine = '%d 1' % (n - 1)
		for i in range(2, n + 1):
			if i != middle:
				anotherLine += ' %d' % i
		print(anotherLine)


from collections import Counter
from math import gcd

def f(a):
	arr = [i for i in range(1, a + 1)]
	s = a * (a + 1) // 2
	for j in range(a, 0, -1):
		if gcd(s, s - j) > 1:
			arr.pop(j - 1)
			print('Yes')
			print(1, j)
			print(len(arr), *arr)
			return ''
	return 'No'
a = int(input())
print(f(a))


n = int(input(''))
if n < 3:
	print('No')
else:
	s = n * (n + 1) // 2
	sol = []
	for i in range(1, n + 1):
		sol.append(i)
	if s % 2 == 0:
		print('Yes')
		print(1, 2)
		print(n - 1, *list(set(sol) - set([2])))
	else:
		for j in range(3, n + 1):
			if s % j == 0:
				print('Yes')
				print(1, j)
				print(n - 1, *list(set(sol) - set([j])))
				break


import math
t = int(input())
a = []
b = []
for i in range(1, t + 1):
	if i & 1:
		a.append(i)
	else:
		b.append(i)
if math.gcd(sum(a), sum(b)) > 1:
	print('Yes')
	print(len(a), end=' ')
	for i in a:
		print(i, end=' ')
	print(' ')
	print(len(b), end=' ')
	for j in b:
		print(j, end=' ')
else:
	print('No')


n = int(input())
if n <= 2:
	print('No')
	exit()
else:
	print('Yes')
	a = list(range(1, n))
	print(n - 1, *a)
	print(1, n)


n = int(input())
if n == 1:
	print('No')
elif n == 2:
	print('No')
else:
	sum_of_n = n * (n + 1) // 2
	partition = 0
	for i in range(2, sum_of_n):
		if sum_of_n % i == 0:
			partition = i
			break
	if partition == 0:
		print('No')
	else:
		print('Yes')
		print(1, partition)
		print(n - 1, end=' ')
		for i in range(1, n + 1):
			if partition == i:
				continue
			else:
				print(i, end=' ')


n = int(input())
x = 35
if n <= 2:
	exit(print('No'))
t = (n + 1) // 2
print('Yes')
print((n + 1) // 2, end=' ')
for i in range(1, n + 1, 2):
	print(i, end=' ')
print('')
print(n // 2, end=' ')
for i in range(2, n + 1, 2):
	print(i, end=' ')


ll = lambda : map(int, input().split())
t = lambda : int(input())
ss = lambda : input()
lx = lambda x: map(int, input().split(x))
yy = lambda : print('Yes')
nn = lambda : print('No')
from math import log10, log2, ceil, factorial as fac, gcd, inf, sqrt, log
from bisect import bisect_right as br, bisect_left as bl
from collections import Counter
mod = 10 ** 9 + 7

def f():
	n = t()
	s = n * (n + 1) // 2 - 1
	s1 = 1
	l = list(range(2, n + 1))
	p = [1]
	while len(l) - 1 > 0:
		x = l.pop(0)
		p.append(x)
		s1 += x
		s -= x
		if gcd(s, s1) > 1:
			yy()
			print(len(p), *p)
			print(len(l), *l)
			return
	nn()
f()


def gcd(a, b):
	if not b:
		return a
	return gcd(b, a % b)
from sys import exit
n = int(input())
if n < 3:
	print('No')
	exit()
need = (n + 1) * n // 2
q = -1
for i in range(1, n + 1):
	if gcd(need - i, i) > 1:
		q = i
		break
if q == -1:
	print('No')
	exit()
print('Yes')
print(1, q)
print(n - 1, end=' ')
for i in range(1, n + 1):
	if i != q:
		print(i, end=' ')


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	num1 = []
	num2 = []
	if False:
		num1.append(1)
		num1.append(n)
		for i in range(2, n):
			num2.append(i)
	else:
		for i in range(1, n + 1):
			if i % 2:
				num1.append(i)
			else:
				num2.append(i)
	print(len(num1), *num1)
	print(len(num2), *num2)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from bisect import bisect_right
n = int(input())
s = n * (n + 1) // 2
f = 0
s1 = [i for i in range(1, n + 1)]
ans = 1
for i in range(2, n + 1):
	var = s - i
	if var % i == 0:
		f = 1
		ans = i
		break
print('Yes' if f == 1 else 'No')
if f == 1:
	s1.remove(ans)
	print(1, ans)
	print(n - 1, *s1)
	exit()
else:
	exit()


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	if n % 2 == 0:
		a = n // 2
	else:
		a = (n + 1) // 2
	print('1 ' + str(a))
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if i != a:
			print(i, end=' ')
	print()


n = int(input())
l_odd = []
l_even = []
l = [x for x in range(1, n + 1)]
if n <= 2:
	print('No')
elif n % 2 == 0:
	for i in range(n):
		if i % 2 == 0:
			l_odd.append(l[i])
		else:
			l_even.append(l[i])
	print('Yes')
	print(n // 2, *l_odd)
	print(n // 2, *l_even)
else:
	for i in range(n):
		if i % 2 == 0:
			l_odd.append(l[i])
		else:
			l_even.append(l[i])
	print('Yes')
	print(len(l_odd), *l_odd)
	print(len(l_even), *l_even)


n = int(input())
nn = n
if n <= 2:
	print('No')
else:
	print('Yes')
	pl = []
	se = 0
	s = 0
	for i in range(1, n + 1):
		pl.append(i)
		s += i
	for i in pl:
		if (s - i) % i == 0 and i != 1:
			se = i
			break
	print(1, se)
	pl.remove(se)
	print(n - 1, *pl)


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	s1 = []
	s2 = []
	s1_sum = 0
	s2_sum = 0
	if n % 2 == 0:
		for i in range(1, n + 1, 2):
			s1.append(i)
			s2.append(i + 1)
	else:
		for i in range(1, n, 2):
			s1.append(i)
			s2.append(i + 1)
		s1.append(n)
	print('Yes')
	(print(len(s1), end=' '),)
	for i in range(len(s1)):
		print(s1[i], end=' ')
	print()
	(print(len(s2), end=' '),)
	for i in range(len(s2)):
		print(s2[i], end=' ')


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	a = [x + 1 for x in range(n)]
	if n % 2 == 0:
		b = [1, n]
		del a[0]
		del a[-1]
	else:
		b = [(1 + n) // 2]
		del a[(1 + n) // 2 - 1]
	print(len(a), ' '.join([str(x) for x in a]))
	print(len(b), ' '.join([str(x) for x in b]))


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	if n % 2 == 0:
		print('1 ' + str(n // 2))
		print(str(n - 1) + ' ' + ' '.join([str(x) for x in set([x for x in range(1, n + 1)]) - set([n // 2])]))
	else:
		print('1 ' + str((n + 1) // 2))
		print(str(n - 1) + ' ' + ' '.join([str(x) for x in set([x for x in range(1, n + 1)]) - set([(n + 1) // 2])]))


t = int(input())
if t == 1:
	print('No')
elif t == 2:
	print('No')
else:
	print('Yes')
	s = 0
	p = 0
	if t % 2 == 0:
		s = t // 2
		p = t // 2
	else:
		s = t // 2
		p = t // 2
		p = p + 1
	k = [s]
	l = [p]
	for i in range(1, t + 1):
		if i % 2 == 0:
			k.append(i)
		else:
			l.append(i)
	print(*k)
	print(*l)


import sys
import math
import bisect

def solve(n):
	if n <= 2:
		return None
	ans = []
	if n % 2 == 0:
		A = []
		B = []
		for i in range(1, n + 1):
			if i == n // 2:
				A.append(i)
			else:
				B.append(i)
		ans.append(A)
		ans.append(B)
		return ans
	elif (n + 1) % 2 == 0:
		A = []
		B = []
		for i in range(1, n + 1):
			if i == (n + 1) // 2:
				A.append(i)
			else:
				B.append(i)
		ans.append(A)
		ans.append(B)
		return ans

def main():
	n = int(input())
	ans = solve(n)
	if ans:
		print('Yes')
		for i in range(2):
			print(len(ans[i]), end=' ')
			print(' '.join(list((str(a) for a in ans[i]))))
	else:
		print('No')
main()


n = int(input())
s = n * (n + 1) // 2
y = False
idx = -1
for i in range(2, n + 1):
	if (s - i) % i == 0:
		y = True
		idx = i
		break
if y:
	print('Yes')
	print(1, idx)
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if i != idx:
			print(i, end=' ')
else:
	print('No')


import math
n = int(input())
if n <= 2:
	print('No')
	exit()
s = n * (n + 1) // 2
for i in range(2, n + 1):
	if math.gcd(i, s - i) > 1:
		x = i
		break
print('Yes')
print(1, x)
print(n - 1, end=' ')
for i in range(1, n + 1):
	if i != x:
		print(i, end=' ')


import sys
import string

def ria():
	return [int(i) for i in input().split()]
i = ria()[0]
id = sum([i for i in range(i + 1)])
bad = True
for j in range(2, i + 1):
	if id % j == 0:
		print('Yes')
		print(1, j)
		print(i - 1, end=' ')
		for d in range(1, i + 1):
			if d == j:
				continue
			print(d, end=' ')
		exit(0)
print('No')


n = int(input())
if n < 3:
	print('No')
elif n == 3:
	print('Yes')
	print('1 2')
	print('2 1 3')
else:
	print('Yes')
	if n % 2 == 0:
		if n % 4 == 0:
			printres = str(int(n / 2)) + ' '
			for i in range(1, int(n / 2) + 1, 2):
				printres += str(i) + ' ' + str(n - i + 1) + ' '
			print(printres)
			printres = str(int(n / 2)) + ' '
			for i in range(2, int(n / 2) + 1, 2):
				printres += str(i) + ' ' + str(n - i + 1) + ' '
			print(printres)
		else:
			printres = str(int((n - 2) / 2) + 2) + ' '
			for i in range(1, int(n / 2) + 1, 2):
				printres += str(i) + ' ' + str(n - i + 1) + ' '
			print(printres)
			printres = str(int((n - 2) / 2)) + ' '
			for i in range(2, int(n / 2) + 1, 2):
				printres += str(i) + ' ' + str(n - i + 1) + ' '
			print(printres)
	elif n % 4 == 1:
		printres = str(int(n / 2) + 1) + ' '
		for i in range(1, n // 2 + 1, 2):
			printres += str(i) + ' ' + str(n - i + 1) + ' '
		print(printres + str(n // 2 + 1))
		printres = str(int(n / 2)) + ' '
		for i in range(2, n // 2 + 1, 2):
			printres += str(i) + ' ' + str(n - i + 1) + ' '
		print(printres)
	else:
		printres = str(int((n - 2) / 2) + 3) + ' '
		for i in range(1, n // 2 + 1, 2):
			printres += str(i) + ' ' + str(n - i + 1) + ' '
		print(printres + str(n // 2 + 1))
		printres = str(int((n - 2) / 2)) + ' '
		for i in range(2, n // 2 + 1, 2):
			printres += str(i) + ' ' + str(n - i + 1) + ' '
		print(printres)


N = int(input())
totalSum = N * (N + 1) / 2
result = None
for i in range(2, N + 1):
	if totalSum % i == 0:
		result = i
		break
if result is not None:
	rest = [str(x) for x in range(1, N + 1)]
	rest.remove(str(result))
	print('Yes')
	print('%d %d' % (1, i))
	print('%d %s' % (N - 1, ' '.join(rest)))
else:
	print('No')


from math import gcd
n = int(input())
s = n * (n + 1) // 2
cnt = 0
for i in range(1, n):
	cnt += i
	s -= i
	if gcd(s, cnt) > 1:
		print('Yes')
		print(i, *list(range(1, i + 1)))
		print(n - i, *list(range(i + 1, n + 1)))
		exit()
print('No')


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	print(1, n)
	print(n - 1, ' '.join(list(map(str, range(1, n)))))


n = int(input())
if n <= 2:
	print('No')
else:
	s = n * (n + 1) // 2
	d = 2
	while s % d != 0:
		d += 1
	print('Yes')
	print(1, d)
	print(n - 1, ' '.join([str(i) for i in range(1, n + 1) if i != d]))


def gcd(m, n):
	if m == 0:
		return n
	return gcd(n % m, m)
n = int(input())
sum1 = 0
sum2 = 0
if n <= 2:
	print('No')
elif n % 2:
	for i in range(1, n + 1):
		if i % 2:
			sum1 += i
		else:
			sum2 += i
	if gcd(sum2, sum1) <= 1:
		print('No')
	else:
		print('Yes')
		print(n // 2, end=' ')
		for i in range(2, n + 1, 2):
			print(i, end=' ')
		print()
		print(n // 2 + 1, end=' ')
		for i in range(1, n + 1, 2):
			print(i, end=' ')
		print()
else:
	print('Yes')
	print(n // 2, end=' ')
	for i in range(2, n + 1, 2):
		print(i, end=' ')
	print()
	print(n // 2, end=' ')
	for i in range(1, n + 1, 2):
		print(i, end=' ')
	print()


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	k = 0 - -n // 2
	print(1, k)
	print(n - 1, *[x for x in range(1, n + 1) if x != k])


import sys
N = int(sys.stdin.readline().strip())
sum = N * (N + 1) / 2
if N % 2 == 0:
	tmp = N // 2
else:
	tmp = (N + 1) // 2
if tmp <= 1:
	print('No')
else:
	print('Yes')
	print('1 {}'.format(tmp))
	print('{} '.format(N - 1) + ' '.join([str(item) for item in range(1, N + 1) if item != tmp]))


import sys
n = int(input())
sum = (1 + n) * n // 2
found = False
i = 2
while i < n + 1:
	if (sum - i) % i == 0:
		found = True
		break
	i += 1
if found == False:
	print('No')
else:
	print('Yes')
	print(1, i)
	print(n - 1, end=' ')
	for j in range(1, n + 1):
		if j != i:
			print(j, end=' ')


a = int(input())
if a > 2:
	print('Yes')
	print(1, a)
	print(a - 1, *[i for i in range(1, a)])
else:
	print('No')


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	o = (n + 1) // 2
	e = n // 2
	i = 1
	print(o, end=' ')
	while i <= n:
		print(i, end=' ')
		i += 2
	i = 2
	print()
	print(e, end=' ')
	while i <= n:
		print(i, end=' ')
		i += 2


n = int(input())
N = (n + 1) * n // 2
for i in range(2, n + 1):
	if (N - i) % i == 0:
		print('Yes\n1 ' + str(i) + '\n' + str(n - 1), end=' ')
		for j in range(1, n + 1):
			if j != i:
				print(j, end=' ')
		exit(0)
print('No')


n = int(input())
if n <= 2:
	print('No')
else:
	setA = set()
	setB = set()
	for i in range(1, n + 1):
		if i & 1:
			setA.add(i)
		else:
			setB.add(i)
	print('Yes')
	print(len(setA), *setA, sep=' ')
	print(len(setB), *setB, sep=' ')


import math
pre = []
for i in range(0, 45010):
	pre.append(i * (i + 1) // 2)
n = int(input())
if n == 0 or n == 1 or n == 2:
	print('No')
else:
	temp = 0
	t = pre[n]
	pos = -1
	for j in range(1, n + 1):
		if math.gcd(pre[j], t - pre[j]) > 1:
			temp = 1
			pos = j
			break
	if temp == 0:
		print('No')
	else:
		print('Yes')
		print(pos, end=' ')
		for j in range(1, pos + 1):
			print(j, end=' ')
		print(' ')
		print(n - j, end=' ')
		for j in range(pos + 1, n + 1):
			print(j, end=' ')
		print(' ')


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	if n % 2 == 0:
		print(1, n // 2)
		print(n - 1, *[i for i in range(1, n // 2)] + [i for i in range(n // 2 + 1, n + 1)])
	else:
		print(1, n)
		print(n - 1, *[i for i in range(1, n)])


import sys
import os

def solve(n):
	if n <= 2:
		print('No')
	else:
		print('Yes')
		print(' '.join(map(str, [2, 1, n])))
		print(' '.join(map(str, [n - 2] + list(range(2, n)))))

def main():
	n = int(input())
	solve(n)
main()


z = input
from math import ceil, gcd, log
n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	print(n - 2, *range(2, n))
	print(2, 1, n)


from math import gcd

def evenodd(integer):
	a = []
	b = []
	for i in range(1, integer + 1):
		if i % 2 is 0:
			a.append(i)
		else:
			b.append(i)
	sa = sum(a)
	sb = sum(b)
	if gcd(sa, sb) > 1:
		print('Yes')
		a = [len(a)] + a
		b = [len(b)] + b
		print(*a)
		print(*b)
	else:
		print('No')

def main():
	k = int(input())
	evenodd(k)
main()


from math import *
n = int(input())
tot = n * (n + 1) // 2
factor = -1
for i in range(1, int(sqrt(tot)) + 1):
	if i == 1 or i == tot:
		continue
	if tot % i == 0:
		factor = i
		break
if factor == -1:
	print('No')
	exit(0)
print('Yes')
g1 = [factor]
g2 = [i for i in range(1, n + 1) if i != factor]
print(len(g1), end=' ')
for i in g1:
	print(i, end=' ')
print()
print(len(g2), end=' ')
for i in g2:
	print(i, end=' ')


def gcd(a, b):
	while b > 0:
		(a, b) = (b, a % b)
	return a
k = int(input())
(s1, s2) = ([], [])
for i in range(1, k + 1):
	if i % 2 == 0:
		s1.append(i)
	else:
		s2.append(i)
if gcd(sum(s1), sum(s2)) > 1:
	print('Yes')
	print(len(s1), ' '.join(map(str, s1)))
	print(len(s2), ' '.join(map(str, s2)))
else:
	print('No')


n = int(input())
if n <= 2:
	print('No')
else:
	arr = [n - 1]
	if n % 2 == 0:
		k = n // 2
	else:
		k = (n + 1) // 2
	for i in range(1, n + 1):
		if i != k:
			arr.append(i)
		else:
			continue
	arr2 = [1, k]
	print('Yes')
	print(' '.join(map(str, arr2)))
	print(' '.join(map(str, arr)))


def main():
	n = int(input())
	if n > 2:
		sol = list(range(2, n + 1))
		del sol[-2]
		print('Yes')
		print('2 1', n - 1)
		print(len(sol), *sol)
	else:
		print('No')
main()


n = int(input())
if n == 1 or n == 2:
	print('No')
elif n % 2 != 0:
	print('Yes')
	s1_size = n // 2
	s2_size = s1_size + 1
	print(s1_size, end=' ')
	for i in range(2, n, 2):
		print(i, end=' ')
	print()
	print(s2_size, end=' ')
	for i in range(1, n + 1, 2):
		print(i, end=' ')
else:
	print('Yes')
	print(1, n // 2)
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if i != n // 2:
			print(i, end=' ')


n = int(input())
s = []
s1 = []

def gcd(a, b):
	while b != 0:
		t = int(a)
		a = int(b)
		b = t % a
	return int(a)
for i in range(1, n + 1):
	if i & 1:
		s.append(i)
	else:
		s1.append(i)
if gcd(sum(s), sum(s1)) <= 1:
	print('No')
else:
	print('Yes')
	print(len(s), *s)
	print(len(s1), *s1)


n = int(input())
s1 = ''
s2 = ''
q = r = 0
if n <= 2:
	print('No')
elif n % 4 == 3 or n % 4 == 0:
	for i in range(1, n + 1):
		if i % 2 == 0:
			s2 += str(i) + ' '
			q += 1
		else:
			r += 1
			s1 += str(i) + ' '
	print('Yes')
	s1 = str(r) + ' ' + s1
	s2 = str(q) + ' ' + s2
	print(s1)
	print(s2)
elif n % 4 == 1 or n % 4 == 2:
	w = (n + 1) // 2
	for i in range(1, n + 1):
		if i <= w:
			r += 1
			s1 += str(i) + ' '
		else:
			q += 1
			s2 += str(i) + ' '
	print('Yes')
	s1 = str(r) + ' ' + s1
	s2 = str(q) + ' ' + s2
	print(s1)
	print(s2)


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	s = 0
	m = []
	m.append(1)
	for i in range(1, n + 1):
		s += i
	for i in range(2, n + 1):
		if s % i == 0:
			m.append(i)
			break
	print(*m, sep=' ')
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if m[1] != i:
			print(i, end=' ')


n = int(input())
a = []
b = []
check = False
if n % 3 == 0:
	check = True
	for i in range(1, n + 1):
		if i % 3 == 0:
			b.append(i)
		else:
			a.append(i)
elif n % 2 == 1 and n // 2 % 2 == 1 or (n % 2 == 0 and n // 2 % 2 == 0):
	check = True
	for i in range(1, n + 1):
		if i % 2 == 0:
			a.append(i)
		else:
			b.append(i)
elif n % 2 == 1 and n > 1:
	check = True
	a.append(n)
	for i in range(1, n):
		b.append(i)
elif n % 2 == 0 and n // 2 % 2 == 1 and (n != 2):
	check = True
	a.append(n // 2)
	for i in range(1, n + 1):
		b.append(i)
	b.remove(n // 2)
if check:
	print('Yes')
	print(len(a), end=' ')
	for i in a:
		print(i, end=' ')
	print()
	print(len(b), end=' ')
	for i in b:
		print(i, end=' ')
	print()
else:
	print('No')


n = int(input())
if n % 2 == 0:
	(a, b) = (n // 2, n + 1)
else:
	(a, b) = ((n + 1) // 2, n)
if min(a, b) > 1:
	print('Yes')
	x = min(a, b)
	print(1, x)
	print(n - 1, *range(1, x), *range(x + 1, n + 1))
else:
	print('No')


from math import *
n = int(input())
if n == 1 or n == 2:
	print('No')
elif n == 3:
	print('Yes')
	print('1 2')
	print('2 1 3')
else:
	print('Yes')
	print(n // 2, end=' ')
	for i in range(n // 2):
		print(2 * i + 2, end=' ')
	print()
	print(ceil(n / 2), end=' ')
	for i in range(ceil(n / 2)):
		print(2 * i + 1, end=' ')
	print()


import string
n = int(input())
if n < 3:
	print('No')
elif n % 2:
	print('Yes')
	print('1 %s' % n)
	print(str(n - 1) + ' ' + ' '.join(map(str, range(1, n))))
else:
	print('Yes')
	print('1 %s' % (n // 2))
	print(str(n - 1) + ' ' + ' '.join(map(str, range(1, n // 2))) + ' ' + ' '.join(map(str, range(n // 2 + 1, n + 1))))


n = int(input())
sum = n * (n + 1) // 2
ans = 'No'
fans = 0
for i in range(2, n + 1):
	if (sum - i) % i == 0:
		ans = 'Yes'
		fans = i
		break
print(ans)
if fans:
	print(1, fans)
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if fans == i:
			continue
		print(i, end=' ')
	print()


t = int(input())
if t == 1 or t == 2:
	print('No')
elif t % 2 == 0:
	print('Yes')
	print(t // 2, end=' ')
	for x in range(1, t + 1, 2):
		print(x, end=' ')
	print('\n', end='')
	print(t // 2, end=' ')
	for x in range(2, t + 1, 2):
		print(x, end=' ')
elif (t - 1) / 2 % 2 == 1:
	print('Yes')
	print(1, 2)
	print(t - 1, end=' ')
	for x in range(1, t + 1):
		if x != 2:
			print(x, end=' ')
else:
	print('Yes')
	print(1, t)
	print(t - 1, end=' ')
	for x in range(t - 1, 0, -1):
		print(x, end=' ')


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	ans = []
	sj = n * (n + 1) // 2
	if sj % 2 == 0:
		ans.append(2)
		for i in range(n):
			if i != 1:
				ans.append(i + 1)
	else:
		ans.append(n)
		for i in range(n):
			if i != n - 1:
				ans.append(i + 1)
	print('Yes')
	print(str(1) + ' ' + str(ans[0]))
	print(str(n - 1) + ' ' + ' '.join(list(map(str, ans[1:]))))


n = int(input())
if n <= 2:
	print('No')
	exit()
print('Yes')
print(n // 2, end=' ')
lis = [x for x in range(2, n + 1, 2)]
print(' '.join(map(str, lis)))
if n & 1:
	print(n // 2 + 1, end=' ')
else:
	print(n // 2, end=' ')
lis = [x for x in range(1, n + 1, 2)]
print(' '.join(map(str, lis)))


import functools
import time
from collections import Counter

def timer(func):

	@functools.wraps(func)
	def wrapper(*args, **kwargs):
		stime = time.perf_counter()
		res = func(*args, **kwargs)
		elapsed = time.perf_counter() - stime
		print(f'{func.__name__} in {elapsed:.4f} secs')
		return res
	return wrapper

class solver:

	def __init__(self):
		pass

	def __call__(self):
		n = int(input())
		s = n * (n + 1) // 2
		x = 2
		while x * x <= s:
			if s % x == 0:
				s1 = [x]
				s2 = [i for i in range(1, n + 1) if i != x]
				print('Yes')
				print(len(s1), ' '.join(map(str, s1)))
				print(len(s2), ' '.join(map(str, s2)))
				exit(0)
			x += 1
		print('No')
solver()()


import sys, os, io

def SieveOfEratosthenes(n):
	ans = []
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	for p in range(2, n + 1):
		if prime[p]:
			ans.append(p)
	return ans
n = int(input())
if n == 1:
	print('No')
else:
	p = SieveOfEratosthenes(n)
	s = n * (n + 1) // 2
	flag = -1
	for i in p:
		if s % i == 0:
			flag = i
			break
	if flag != -1:
		print('Yes')
		print(1, flag)
		ans = []
		for i in range(1, n + 1):
			if i != flag:
				ans.append(i)
		print(n - 1, *ans)
	else:
		print('No')


n = int(input())
if n > 2:
	A = []
	B = []
	for i in range(1, n + 1, 2):
		A.append(i)
	for i in range(2, n + 1, 2):
		B.append(i)
	print('Yes')
	print(len(A), *A)
	print(len(B), *B)
else:
	print('No')


from sys import *

def check(n):
	if n <= 2:
		print('No')
		return
	print('Yes')
	s1 = n * (n - 1) // 2
	s2 = n
	print(n - 1, end=' ')
	for i in range(1, n, 1):
		print(i, end=' ')
	print()
	print(1, end=' ')
	print(n)
n = int(input())
check(n)


from fractions import gcd

def exe():
	set1 = []
	set2 = []
	i = 1
	j = n
	while i < j:
		if i % 2 == 1:
			set1.append(i)
			set1.append(j)
		else:
			set2.append(i)
			set2.append(j)
		i = i + 1
		j = j - 1
	if i == j:
		if len(set1) > len(set2):
			set2.append(i)
		else:
			set1.append(i)
	print(len(set1), end=' ')
	print(*set1, sep=' ')
	print(len(set2), end=' ')
	print(*set2, sep=' ')
n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	exe()


n = int(input())
if n < 3:
	print('No')
elif n % 4 == 0 or n % 4 == 3:
	print('Yes')
	print('1 2')
	(print(n - 1),)
	for i in range(1, n + 1):
		if i == 2:
			continue
		(print(i),)
else:
	sum = (n + 1) * int(n / 2) + n % 2 * int((n + 1) / 2)
	temp = -1
	for i in range(2, n + 1):
		if (sum - i) % i == 0:
			temp = i
			break
	if temp == -1:
		print('No')
	else:
		print('Yes')
		print('1 {}'.format(temp))
		(print(n - 1),)
		for i in range(1, n + 1):
			if i == temp:
				continue
			(print(i),)


def main():
	n = int(input())
	tot = n * (n + 1) // 2
	for x in range(2, n + 1):
		if tot % x == 0:
			print('Yes')
			print('1 {}'.format(x))
			o = [y for y in range(1, n + 1) if y != x]
			print('{} {}'.format(len(o), ' '.join((str(x) for x in o))))
			return
	print('No')
main()


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	print(1, end=' ')
	print(n)
	i = 1
	print(n - 1, end=' ')
	while i < n:
		print(i, end=' ')
		i += 1


def main():
	(n, r) = (int(input()), False)
	if n < 3:
		print('No')
		return
	print('Yes')
	if n & 1:
		print(1, n)
		print(n - 1, *range(1, n))
	else:
		print(1, n // 2)
		print(n - 1, *range(1, n // 2), *range(n // 2 + 1, n + 1))
main()


n = int(input())
s = sum(range(1, n + 1))
c = s ** 0.5
i = 2
f = False
while i <= c:
	if s % i == 0:
		print('Yes')
		print(1, i)
		print(n - 1, *list(range(1, i)), *list(range(i + 1, n + 1)))
		exit(0)
	i += 1
print('No')


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	c = []
	d = []
	for j in range(1, n + 1):
		if j % 2 == 0:
			d.append(j)
		else:
			c.append(j)
	print(f'{len(c)}', end=' ')
	print(*c)
	print(f'{len(d)}', end=' ')
	print(*d)


a = int(input())
t = a * (a + 1) // 2
if a <= 2:
	print('No')
else:
	print('Yes')
	for k in range(2, a):
		if t % k == 0:
			break
	f = []
	for i in range(1, a + 1):
		if i != k:
			f.append(i)
	print(1, k)
	print(len(f), end=' ')
	print(*f)


n = int(input())
if n in [1, 2]:
	print('No')
else:
	print('Yes')
	if n % 2 == 0:
		print(2, n // 2, n // 2 + 1)
		l = [str(i) for i in range(1, n + 1)]
		l.pop(n // 2 - 1)
		l.pop(n // 2 - 1)
		print(n - 2, ' '.join(l))
	else:
		print(1, n // 2 + 1)
		l = [str(i) for i in range(1, n + 1)]
		l.pop(n // 2)
		print(n - 1, ' '.join(l))


n = int(input())
a = []
b = []
flag = 0
if n % 2 == 1 and n // 2 % 2 == 1:
	for i in range(1, n + 1):
		if i % 2 == 0:
			a.append(i)
		else:
			b.append(i)
elif n % 2 == 1 and n // 2 % 2 == 0:
	if n == 1:
		print('No')
		flag = 1
	else:
		for i in range(1, n):
			a.append(i)
		b.append(n)
elif n % 2 == 0 and n // 2 % 2 == 0:
	for i in range(1, n + 1):
		if i % 2 == 0:
			a.append(i)
		else:
			b.append(i)
elif n % 2 == 0 and n // 2 % 2 == 1:
	if n == 2:
		print('No')
		flag = 1
	else:
		for i in range(1, n):
			a.append(i)
		b.append(n)
if flag == 0:
	print('Yes')
	print(len(a), end=' ')
	for i in a:
		print(i, end=' ')
	print()
	print(len(b), end=' ')
	for i in b:
		print(i, end=' ')
	print()


n = int(input().rstrip())
total = n * (n + 1) // 2
result = 0
for i in range(2, n + 1):
	if total % i == 0:
		result = i
if result:
	s1 = result
	s2 = [x for x in range(1, n + 1)]
	s2.remove(s1)
	print('Yes')
	print(1, s1)
	print(len(s2), ' '.join(map(str, s2)).rstrip())
else:
	print('No')


from sys import stdin, exit
from os import getenv
if getenv('ACM_ENV') == 'local':
	stdin = open('input.txt', 'r')
n = int(stdin.readline())
if n < 3:
	print('No')
	exit()
print('Yes')
s1 = []
s2 = []
for i in range(1, n + 1):
	if i % 2 == 0:
		s1.append(str(i))
	else:
		s2.append(str(i))
print(len(s1), ' '.join(s1))
print(len(s2), ' '.join(s2))


n = int(input())
if n == 1:
	print('No')
elif n == 2:
	print('No')
else:
	print('Yes')
	if n % 2 == 0:
		A = n // 2
	else:
		A = (n + 1) // 2
	print(1, A)
	print(n - 1, *[b for b in range(1, n + 1) if b != A])


def gcd(a, b):
	while b != 0:
		(a, b) = (b, a % b)
	return a
n = int(input())
c = 0
c2 = 0
a = [int(i) for i in range(1, n + 1, 2)]
b = [int(i) for i in range(2, n + 1, 2)]
if gcd(sum(a), sum(b)) > 1:
	print('Yes')
	print(len(a), *a)
	print(len(b), *b)
else:
	print('No')


def gcd(a, b):
	if b == 0:
		return a
	else:
		return gcd(b, a % b)
n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes\n1 ', end='')
	s = set()
	for i in range(1, n + 1):
		s.add(i)
	x = sum(s)
	if x % 2 == 1:
		for i in range(3, x, 2):
			if gcd(i, x - i) > 1:
				y = i
				break
		s.remove(i)
		print(i)
	else:
		s.remove(2)
		print(2)
	print(len(s), end=' ')
	for i in s:
		print(i, end=' ')


from fractions import gcd
n = int(input())
if n <= 2:
	print('No')
else:
	s = sum(range(1, n + 1))
	k = -1
	for i in range(2, s // 2 + 1):
		if s % i == 0:
			k = i
			break
	if k == -1:
		print('No')
	else:
		print('Yes')
		print(1, k)
		print(n - 1, *range(1, k), *range(k + 1, n + 1))


n = int(input())
if n <= 2:
	print('No')
elif n % 2 == 0:
	k = n // 2
	if k % 2 == 0:
		print('Yes')
		print('2', end=' ')
		print('1 3')
		print('')
		print(n - 2, end=' ')
		for i in range(1, n + 1):
			if i != 1 and i != 3:
				print(i, end=' ')
	else:
		print('Yes')
		print(k, end=' ')
		for i in range(1, k + 1):
			print(i, end=' ')
		print('')
		print(k, end=' ')
		for i in range(k + 1, n + 1):
			print(i, end=' ')
else:
	print('Yes')
	print(n - 1, end=' ')
	for i in range(1, n):
		print(i, end=' ')
	print('')
	print('1', end=' ')
	print(n)


n = int(input())
a = 0
B = []
A = []
for i in range(1, n + 1):
	A.append(i)
b = 0
for i in range(1, n + 1):
	if i % 2 == 1:
		b += 1
if n < 3:
	print('No')
elif b % 2 == 0:
	print('Yes')
	print(1, 2)
	A[0] = n - 1
	A[1] = 1
	for elem in A:
		print(elem, end=' ')
elif n % 2 == 0:
	print('Yes')
	print(1, n)
	A[0] = n - 1
	for i in range(1, n):
		A[i] = i
	for elem in A:
		print(elem, end=' ')
else:
	print('Yes')
	B.append(n // 2 + 1)
	for i in range(1, n // 2 + 2):
		B.append(i)
	for elem in B:
		print(elem, end=' ')
	print()
	X = []
	X.append(n // 2)
	for i in range(n // 2 + 2, n + 1):
		X.append(i)
	for elem in X:
		print(elem, end=' ')


cnt = lambda s, x: s.count(x)
ii = lambda : int(input())
si = lambda : input()
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
dgl = lambda : list(map(int, input()))
n = ii()
l = [_ for _ in range(1, n + 1)]
g = 1
sm = n * (n + 1) // 2
for i in range(2, n + 1):
	if sm % i == 0:
		g = i
		l.remove(i)
		break
if g == 1:
	print('No')
else:
	print('Yes')
	print(1, g)
	print(n - 1, *l)


def gcd(a, b):
	while b != 0:
		(a, b) = (b, a % b)
	return a

def Sum(n):
	return n * (n + 1) // 2
n = int(input())
ans = -1
if n <= 2:
	print('No')
else:
	for i in range(2, n):
		if gcd(Sum(i), Sum(n) - Sum(i)) - 1:
			ans = i
			break
	if ans != -1:
		print('Yes')
		print(' '.join(list(map(str, [ans] + list(range(1, ans + 1))))))
		print(' '.join(list(map(str, [n - ans] + list(range(ans + 1, n + 1))))))
	else:
		print('No')


import math as ma
import sys
from sys import exit
from decimal import Decimal as dec
from itertools import permutations

def li():
	return list(map(int, input().split()))

def modInverse(a, m):
	m0 = m
	y = 0
	x = 1
	if m == 1:
		return 0
	while a > 1:
		q = a // m
		t = m
		m = a % m
		a = t
		t = y
		y = x - q * y
		x = t
	if x < 0:
		x = x + m0
	return x

def num():
	return map(int, input().split())

def nu():
	return int(input())

def find_gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x
n = nu()
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	print(n - 1, end=' ')
	for i in range(1, n):
		print(i, end=' ')
	print()
	print(1, n)


n = int(input())
if n < 3:
	print('No')
	exit()
if n % 4 in {0, 3}:
	print('Yes')
	print(len(range(1, n + 1, 2)), ' '.join(map(str, range(1, n + 1, 2))))
	print(len(range(2, n + 1, 2)), ' '.join(map(str, range(2, n + 1, 2))))
	exit()
if n % 3 != 1:
	print('Yes')
	print(1, 3)
	print(n - 1, ' '.join(map(str, [i for i in range(1, n + 1) if i != 3])))
	exit()
print('Yes')
i = (n + n % 2) // 2
print(1, i)
print(n - 1, ' '.join(map(str, [el for el in range(1, n + 1) if i != el])))


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	c = 0
	C = []
	d = 0
	D = []
	for i in range(1, n + 1):
		if i % 2 == 0:
			c += 1
			C.append(i)
		else:
			d += 1
			D.append(i)
	print(c, *C)
	print(d, *D)


n = int(input())
if n == 0 or n == 1 or n == 2:
	print('No')
elif n % 2 == 0:
	print('Yes')
	ans_1 = []
	ans_2 = []
	for i in range(n // 2):
		if i % 2 == 0:
			ans_1.append(i + 1)
			ans_1.append(n - i)
		else:
			ans_2.append(i + 1)
			ans_2.append(n - i)
	print(len(ans_1), *ans_1)
	print(len(ans_2), *ans_2)
elif n % 2 == 1 and (n - 3) % 4 == 0:
	print('Yes')
	ans_1 = [1, 2]
	ans_2 = [3]
	for i in range(4, (n - 2) // 2 + 4):
		if i % 2 == 0:
			ans_1.append(i)
			ans_1.append(n - (i - 4))
		else:
			ans_2.append(i)
			ans_2.append(n - (i - 4))
	print(len(ans_1), *ans_1)
	print(len(ans_2), *ans_2)
elif n % 2 == 1:
	print('Yes')
	print(1, n // 2 + 1)
	print(n - 1, *[i for i in range(1, n + 1) if i != n // 2 + 1])


n = int(input())
s = n * (n + 1) // 2
res = 'No'
for i in range(2, n + 1):
	if s % i == 0:
		res = 'Yes\n'
		res += '1 {0}\n{1} '.format(i, n - 1)
		res += ' '.join((str(j + 1) for j in range(n) if j != i - 1))
		break
print(res)


from itertools import accumulate
from math import *
n = int(input())
pf = list(accumulate([i for i in range(1, n + 1)]))
sf = list(accumulate([i for i in range(n, 0, -1)]))
ok = False
ind = 0
for i in range(n - 1):
	if gcd(pf[i], sf[n - 2 - i]) > 1:
		ok = True
		ind = i
		break
if ok:
	print('Yes')
	a = []
	for i in range(1, ind + 2):
		a.append(i)
	print(len(a), *a)
	a = []
	for i in range(ind + 2, n + 1):
		a.append(i)
	print(len(a), *a)
else:
	print('No')


import os
from sys import stdin
max_val = int(10000000000000.0)
min_val = int(-10000000000000.0)

def read_int():
	return int(stdin.readline())

def read_ints():
	return [int(x) for x in stdin.readline().split()]

def read_str():
	return input()

def read_strs():
	return [x for x in stdin.readline().split()]

def read_str_list():
	return [x for x in stdin.readline().split().split()]
noe = read_int()
if noe > 2:
	print('Yes')
	print(1, noe)
	print(noe - 1, *list(range(1, noe)))
else:
	print('No')


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	if n % 2 == 1:
		k = int((n + 1) / 2)
		print(1, int(k))
		s = ''
		for i in range(1, n + 1):
			if i == k:
				continue
			s += str(int(i)) + ' '
		print(n - 1, s)
	else:
		k = n / 2
		print(2, int(k), int(k + 1))
		s = ''
		for i in range(1, n + 1):
			if i == k or i == k + 1:
				continue
			s += str(int(i)) + ' '
		print(n - 2, s)


import sys
I = sys.stdin.readline

def solve():
	n = int(I())
	if n == 1 or n == 2:
		print('No')
	elif n == 3:
		print('Yes')
		print('1 2')
		print('2 1 3')
	else:
		s = n * (n + 1) // 2
		flag = 0
		for i in range(2, n + 1):
			if (s - i) % i == 0:
				flag = i
				break
		if flag:
			s1 = flag
			s2 = [i for i in range(1, n + 1) if i != flag]
			print('Yes')
			print(1, s1)
			print(n - 1, *s2)
		else:
			print('No')
solve()


n = int(input())
total = n * (n + 1) // 2
if n <= 2:
	print('No')
	exit()
if total % 2 == 0:
	print('Yes')
	print('1 2')
	print(f"{n - 1} 1 {' '.join(map(str, range(3, n + 1)))}")
else:
	print('Yes')
	print(f'1 {n}')
	print(f"{n - 1} {' '.join(map(str, range(1, n)))}")


import math

def mi():
	return map(int, input().split(' '))
n = int(input())
sum = n * (n + 1) // 2
li = []
pow = 1
for i in range(2, sum + 1):
	if math.gcd(sum - i, i) > 1 and sum - i > 0:
		print('Yes')
		t = str(bin(i)[::-1])
		for j in t:
			if j == '1':
				li.append(pow)
			pow *= 2
		print(len(li))
		print(*li)
		print(n - len(li), end=' ')
		for j in range(1, n + 1):
			if j not in li:
				print(j, end=' ')
		exit()
print('No')


from math import sqrt
n = int(input())
if n == 1 or n == 2:
	print('No')
	exit()
s1 = []
s2 = [i for i in range(1, n + 1)]
s = n * (n + 1) // 2
num = 0
for i in range(2, int(sqrt(s)) + 1):
	if s % i == 0:
		num = i
		break
maxi = n
for i in range(n):
	if num <= maxi:
		s1.append(num)
		s2.remove(num)
		break
	else:
		s1.append(num)
		s2.remove(num)
		num -= maxi
		maxi -= 1
print('Yes')
print(len(s1), ' '.join(list(map(str, s1))))
print(len(s2), ' '.join(list(map(str, s2))))


N = int(input())
sum = (N + 1) * N // 2
gcd = 1
for i in range(2, N + 1):
	if (sum - i) % i == 0:
		gcd = i
		break
if gcd == 1:
	print('No')
else:
	s1 = []
	s2 = []
	for i in range(1, N + 1):
		if i % gcd == 0:
			s2 += [i]
		else:
			s1 += [i]
	print('Yes')
	print(len(s1), end=' ')
	for s in s1:
		print(s, end=' ')
	print()
	print(len(s2), end=' ')
	for s in s2:
		print(s, end=' ')


from math import inf as inf
from math import *
from collections import *
import sys
input = sys.stdin.readline
t = 1
while t:
	t -= 1
	n = int(input())
	s = n * (n + 1)
	s = s // 2
	fac = set()
	for i in range(2, int(pow(s, 0.5)) + 1):
		if s % i == 0:
			fac.add(i)
			fac.add(s // i)
	if len(fac) == 0:
		print('No')
	else:
		pos = -1
		for i in fac:
			if gcd(i, s - i) > 1 and i <= n:
				pos = i
				break
		if pos < 0:
			print('No')
		else:
			print('Yes')
			print(1, pos)
			c = [i for i in range(1, n + 1)]
			print(n - 1, end=' ')
			c.remove(pos)
			print(*c)


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	a = 0
	an = []
	b = 0
	bn = []
	if n % 2 == 0:
		k = n // 2
		a = 1
		an.append(k)
		b = n - 1
		for i in range(1, n + 1):
			if i != k:
				bn.append(i)
	else:
		k = (n + 1) // 2
		a = 1
		an.append(k)
		b = n - 1
		for i in range(1, n + 1):
			if i != k:
				bn.append(i)
	print(a, end=' ')
	for i in range(a):
		print(an[i], end=' ')
	print()
	print(b, end=' ')
	for i in range(b):
		print(bn[i], end=' ')


from fractions import gcd
import math
n = int(input())
if n == 1 or n == 2 or gcd((n // 2) ** 2 + n // 2, (n // 2 + 1) ** 2) == 1:
	print('No')
else:
	print('Yes')
	s = '' + str(n // 2)
	for i in range(2, n + 1, 2):
		s += ' ' + str(i)
	t = '' + str(int(math.ceil(n / 2)))
	for i in range(1, n + 1, 2):
		t += ' ' + str(i)
	print(s)
	print(t)


import math
n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	l1 = []
	l2 = []
	for i in range(1, n + 1):
		if i % 2 == 0:
			l1.append(i)
		else:
			l2.append(i)
	print(n // 2, *l1)
	print(math.ceil(n / 2), *l2)


import math
n = int(input())
if n < 3:
	print('No')
else:
	o = []
	e = []
	for i in range(1, n + 1):
		if i % 2 == 0:
			e.append(i)
		else:
			o.append(i)
	if math.gcd(sum(e), sum(o)) > 1:
		print('Yes')
		if len(e) < len(o):
			print(len(e), *e)
			print(len(o), *o)
		else:
			print(len(o), *o)
			print(len(e), *e)
	else:
		print('No')


n = int(input())
if n <= 2:
	print('No')
else:
	l = [i for i in range(1, n + 1)]
	if n & 1:
		print('Yes')
		print(1, l[n // 2])
		l.remove(l[n // 2])
		print(len(l), *l)
	else:
		print('Yes')
		print(2, l[n // 2 - 1], l[n // 2])
		l[n // 2 - 1] = -1
		l[n // 2] = -1
		l = [i for i in l if i > 0]
		print(len(l), *l)


import math
n = int(input())
x = math.ceil(n / 2)
if n == 1 or n == 2:
	print('No')
elif n % 4 == 0:
	print('Yes')
	L = [2 * i + 1 for i in range(x)]
	L = [x] + L
	M = [2 * i + 2 for i in range(x)]
	M = [x] + M
	print(*L)
	print(*M)
elif n % 4 == 3:
	print('Yes')
	L = [2 * i + 1 for i in range(x)]
	L = [x] + L
	M = [2 * i + 2 for i in range(x - 1)]
	M = [x - 1] + M
	print(*L)
	print(*M)
else:
	for i in range(3, n, 2):
		if n * (n + 1) // 2 % i == 0:
			p = i
			break
	print('Yes')
	L = [1, p]
	M = [n - 1]
	for i in range(1, n + 1):
		if i != p:
			M.append(i)
	print(*L)
	print(*M)


from math import gcd
n = int(input())
odd = []
even = []
print
for i in range(1, n + 1):
	if i % 2 == 1:
		odd.append(i)
	else:
		even.append(i)
if len(odd) > 0 and len(even) > 0 and (gcd(sum(odd), sum(even)) > 1):
	print('Yes')
	print(len(odd), *odd)
	print(len(even), *even)
else:
	print('No')


class CodeforcesTask1038BSolution:

	def __init__(self):
		self.result = ''
		self.n = 0

	def read_input(self):
		self.n = int(input())

	def process_task(self):
		if self.n <= 2:
			self.result = 'No'
		elif self.n % 2:
			self.result = 'Yes\n{0}\n{1}'.format(' '.join([str(self.n // 2 + self.n % 2)] + [str(x + 1) for x in range(self.n // 2 + self.n % 2)]), ' '.join([str(self.n // 2)] + [str(x + 1) for x in range(self.n // 2 + self.n % 2, self.n)]))
		else:
			self.result = 'Yes\n{0}\n{1}'.format('2 {0} {1}'.format(1, self.n), '{0} {1}'.format(self.n - 2, ' '.join([str(x) for x in range(2, self.n)])))

	def get_result(self):
		return self.result
Solution = CodeforcesTask1038BSolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())


n = int(input())

def conv(ls):
	res = ''
	for x in ls:
		res += str(x) + ' '
	return res
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	if n % 2 == 0:
		print(str(n // 2) + ' ' + conv([i for i in range(1, n, 2)]))
		print(str(n // 2) + ' ' + conv([i for i in range(2, n + 1, 2)]))
	else:
		print(str(n // 2) + ' ' + conv([i for i in range(2, n, 2)]))
		print(str(n // 2 + 1) + ' ' + conv([i for i in range(1, n + 1, 2)]))


n = int(input())

def gcd(x, y):
	if y == 0:
		return x
	else:
		return gcd(y, x % y)
s = n * (n + 1) // 2
y = False
k = 1
for i in range(1, n + 1):
	if 1 < gcd(i, s - i):
		k = i
		y = True
		break
if y:
	print('Yes')
	print(1, k)
	print(n - 1, end=' ')
	print(' '.join([str(i) for i in range(1, n + 1) if i != k]))
else:
	print('No')


n = int(input())
ans = 'NO'
s = (n + 1) * n // 2
i = 2
x = 1
while i * i <= s:
	if s % i == 0:
		x = i
		break
	i += 1
if n <= 2:
	print('No')
else:
	print('Yes')
	print(1, x)
	a = []
	for i in range(1, n + 1):
		a.append(i)
	a.remove(x)
	print(len(a), *a)


n = int(input())
s = []
for i in range(1, n + 1):
	s.append(i)
s1 = []
s2 = []
mid = int(n // 2)
if n <= 2:
	print('No')
elif n % 2 == 0:
	for j in range(0, mid, 2):
		s1.append(s[j])
		s1.append(s[-1 - j])
	for k in range(1, mid, 2):
		s2.append(s[k])
		s2.append(s[-1 - k])
	print('Yes')
	print(len(s1), ' '.join((str(x) for x in s1)))
	print(len(s2), ' '.join((str(x) for x in s2)))
elif n % 2 != 0:
	s1 = s[::2]
	s2 = s[1::2]
	print('Yes')
	print(len(s1), ' '.join((str(x) for x in s1)))
	print(len(s2), ' '.join((str(x) for x in s2)))


n = int(int(input()))
if n == 1:
	print('No')
elif n == 2:
	print('No')
else:
	print('Yes')
	lis = []
	lis1 = []
	for i in range(1, n + 1, 2):
		lis.append(i)
	for i in range(2, n + 1, 2):
		lis1.append(i)
	print(n // 2 + n % 2, *lis)
	print(n // 2, *lis1)


from math import gcd
n = int(input())
k = -1
s1 = n * (n + 1) // 2
for i in range(1, n + 1):
	if gcd(i, s1 - i) > 1:
		k = i
		break
if k != -1:
	ans = [i for i in range(1, n + 1) if i != k]
	print('Yes')
	print('1', k)
	print(len(ans), *ans)
else:
	print('No')


from sys import stdin, stdout, setrecursionlimit
n = int(input())
if n >= 2 and n % 2 == 1:
	print('Yes')
	print('1', n // 2 + 1)
	print(n - 1, end=' ')
	for i in range(1, n // 2 + 1):
		print(i, end=' ')
		print(n - i + 1, end=' ')
elif n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	x = 0
	if n % 4 != 0:
		x = 1
	print(n // 2 - x, end=' ')
	for i in range(1, n // 4 + 1):
		print(i, end=' ')
		print(n - i + 1, end=' ')
	print()
	print(n // 2 + x, end=' ')
	for i in range(n // 4 + 1, n // 2 + 1):
		print(i, end=' ')
		print(n - i + 1, end=' ')


from collections import Counter, defaultdict, deque
get = lambda : int(input())
read = lambda : list(map(int, input().split()))
mod = 10 ** 9 + 7
inf = float('inf')
n = get()
if n <= 2:
	print('No')
else:
	print('Yes')
	print(1, n)
	res = [n - 1] + list(range(1, n))
	print(' '.join(map(str, res)))


n = int(input())
s = range(1, n + 1)

def gcd(a, b):
	if b == 0:
		return a
	else:
		return gcd(b, a % b)
a = None
for i in range(1, n):
	if gcd(sum(s[:i]), sum(s[i:])) > 1:
		a = i
		break
if a == None:
	print('No')
else:
	print('Yes')
	print(len(s[:a]), end=' ')
	for j in s[:a]:
		print(j, end=' ')
	print('')
	print(len(s[a:]), end=' ')
	for k in s[a:]:
		print(k, end=' ')


n = int(input())
summ = n * (n + 1) // 2

def get_divisor(m):
	if m == 1:
		return 1
	for i in range(2, int(m ** 0.5 + 1)):
		if i < m and m % i == 0:
			return i
	return 1
divisor = get_divisor(summ)
if divisor == 1:
	print('No')
	exit()
print('Yes')
print(1, divisor)
print(n - 1, end=' ')
for i in range(1, divisor):
	print(i, end=' ')
for i in range(divisor + 1, n + 1):
	print(i, end=' ')


i = int(input())
if i <= 2:
	print('No')
else:
	print('Yes')
	if i % 2 == 0:
		print(f'1 {int(i / 2)} ')
		print(i - 1, end=' ')
		for k in range(1, int(i / 2), 1):
			print(k, end=' ')
		for m in range(int(i / 2 + 1), int(i + 1), 1):
			print(m, end=' ')
	else:
		print(f'1 {int((i + 1) / 2)}')
		print(i - 1, end=' ')
		for k in range(1, int((i + 1) / 2), 1):
			print(k, end=' ')
		for m in range(int((i + 1) / 2 + 1), int(i + 1), 1):
			print(m, end=' ')
print()


import math
n = int(input())
S1 = list()
S2 = list()
if n < 3:
	print('No')
else:
	k = 0
	if n % 2 == 0:
		k = n // 2
	else:
		k = (n + 1) // 2
	S2.append(k)
	for i in range(1, n + 1):
		if i != k:
			S1.append(i)
	print('Yes')
	print(len(S2), end=' ')
	print(' '.join(map(str, S2)))
	print(len(S1), end=' ')
	print(' '.join(map(str, S1)))


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	evenlist = [str(2 * i) for i in range(1, int((n + 2) / 2))]
	oddlist = [str(2 * i + 1) for i in range(0, int((n + 1) / 2))]
	print(len(evenlist), ' '.join(evenlist))
	print(len(oddlist), ' '.join(oddlist))


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools
import random
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI():
	return [list(map(int, l.split())) for l in sys.stdin.readlines()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def pe(s):
	return print(str(s), file=sys.stderr)

def main():
	n = I()
	if n < 3:
		return 'No'
	t = (n + 1) // 2
	a = list(range(1, n + 1))
	b = a[:t - 1] + a[t:]
	return 'Yes\n1 {}\n{} {}'.format(t, n - 1, ' '.join(map(str, b)))
print(main())


import math

def fact(n):
	ans = 1
	for i in range(2, n + 1):
		ans *= i
	return ans

def comb(n, c):
	return fact(n) // (fact(n - c) * c)
n = int(input())
ans = []
if n <= 2:
	print('No')
else:
	print('Yes')
	if n % 2 == 0:
		k = n // 2
		print(1, k)
		for i in range(1, n + 1):
			if i != k:
				ans.append(str(i))
		print(n - 1, ' '.join(ans))
	else:
		k = (n + 1) // 2
		print(1, k)
		for i in range(1, n + 1):
			if i != k:
				ans.append(str(i))
		print(n - 1, ' '.join(ans))


n = int(input())
if n < 3:
	print('No')
	exit()
print('Yes')
if n % 2:
	print(1, n)
	print(n - 1, *[x for x in range(1, n)])
else:
	print(n // 2, *[x for x in range(2, n + 1, 2)])
	print(n // 2, *[x for x in range(1, n + 1, 2)])


a = int(input())
if a == 1 or a == 2:
	print('No')
else:
	print('Yes')
	print(str(len(list(range(2, a + 1, 2)))) + ' ' + ' '.join([str(i) for i in list(range(2, a + 1, 2))]))
	print(str(len(list(range(1, a + 1, 2)))) + ' ' + ' '.join([str(i) for i in list(range(1, a + 1, 2))]))


n = int(input())
if n <= 2:
	print('No')
if n > 2 and n % 2 != 0:
	print('Yes')
	print(1, n)
	print(n - 1, *list(range(1, n)))
if n > 2 and n % 2 == 0:
	print('Yes')
	print(2, 1, n)
	print(n - 2, *list(range(2, n)))


from math import ceil
n = int(input())
d = n * (n + 1) // 2
j = 0
k = 0
if n == 1:
	print('No')
	exit(0)
else:
	for i in range(1, n + 1):
		if (d - i) // i == ceil((d - i) / i) and (d - i) // i != d - i:
			j = i
			break
if j == 0:
	print('No')
	exit(0)
e = [i for i in range(1, n + 1)]
e.remove(j)
print('Yes')
print(1, j)
print(n - 1, *e)


n = int(input())
import math
summ = int(n * (n + 1) / 2)
j = summ - 2
flag = 0
key1 = 0
key2 = 0
for i in range(2, math.ceil(summ / 2)):
	if math.gcd(i, j) >= 2:
		flag = 1
		(key1, key2) = (i, j)
		break
	j -= 1
if flag == 1:
	print('Yes')
	keyf = min(key1, key2)
	print(1, keyf)
	print(n - 1, end=' ')
	ite = 1
	while True:
		if ite == n + 1:
			break
		elif ite != keyf:
			print(ite, end=' ')
		ite += 1
	print()
else:
	print('No')


n = int(input())
if n < 3:
	print('No')
	exit()
a = []
b = []
for i in range(1, n + 1):
	if i & 1:
		a.append(i)
	else:
		b.append(i)
print('Yes')
print(len(a), end=' ')
print(*a)
print(len(b), end=' ')
print(*b)


import math
n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	t = math.ceil(n / 2)
	print(1, t)
	l = []
	for i in range(1, n + 1):
		if i != t:
			l.append(i)
	print(len(l), *l)


tt = 1
while tt:
	tt -= 1
	n = int(input())
	if n < 3:
		print('No')
	else:
		print('Yes')
		a = []
		b = []
		i = 1
		while i < n + 1:
			a.append(i)
			i += 1
			if i >= n + 1:
				break
			b.append(i)
			i += 1
		print(len(a), *a)
		print(len(b), *b)


def non_cop(n):
	if n == 1 or n == 2:
		print(' No ')
	else:
		l1 = []
		l2 = []
		print('Yes')
		for i in range(1, n + 1):
			if i % 2 == 0:
				l1.append(i)
			else:
				l2.append(i)
		print(len(l1), *l1, sep=' ')
		print(len(l2), *l2, sep=' ')
n = int(input())
non_cop(n)


n = int(input())
if n <= 2:
	print('No')
	exit(0)
print('Yes')
evens = range(2, n + 1, 2)
odds = range(1, n + 1, 2)
print(len(evens), ' '.join(map(str, evens)))
print(len(odds), ' '.join(map(str, odds)))


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	a = [x for x in range(1, n + 1)]
	ind = a.index(n)
	del a[ind]
	print('Yes')
	print(1, n)
	print(n - 1, *a)


a = int(input())
if a == 1 or a == 2:
	print('No')
elif a == 3:
	print('Yes')
	print(1, 2)
	print(2, 1, 3)
elif a == 4:
	print('Yes')
	print(2, 1, 3)
	print(2, 2, 4)
elif a % 2 == 1:
	print('Yes')
	print(a - 1, *range(1, a))
	print(1, a)
elif a % 2 == 0 and a % 4 != 0:
	print('Yes')
	print(a - 1, *range(1, a))
	print(1, a)
else:
	print('Yes')
	print(int(a / 2), *range(1, int(a / 2) + 1))
	print(int(a / 2), *range(int(a / 2) + 1, int(a + 1)))


from math import ceil, sqrt, log, gcd

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().split())

def li():
	return list(mi())

def main():
	n = ii()
	if n == 1 or n == 2:
		print('No')
	else:
		print('Yes')
		x = n // 2
		print(x, end=' ')
		j = 2
		for i in range(x):
			print(j, end=' ')
			j += 2
		print()
		print(n - x, end=' ')
		j = 1
		for i in range(n - x):
			print(j, end=' ')
			j += 2
		print()
main()


n = int(input())
if n < 3:
	print('No')
else:
	tot = n * (n + 1) / 2
	for i in range(2, n + 1):
		if tot % i == 0:
			print('Yes')
			print('1 %d' % i)
			print(str(n - 1), end='')
			for j in range(1, n + 1):
				if j == i:
					continue
				print(' %d' % j, end='')
			exit()


import sys
import math
fileoperation = 0
if fileoperation:
	orig_stdout = sys.stdout
	orig_stdin = sys.stdin
	inputfile = open('W:/Competitive Programming/input.txt', 'r')
	outputfile = open('W:/Competitive Programming/output.txt', 'w')
	sys.stdin = inputfile
	sys.stdout = outputfile
mod = 1000000007

def nospace(l):
	ans = ''.join((str(i) for i in l))
	return ans
t = 1
for tt in range(t):
	n = int(input())
	s = n * (n + 1) // 2
	a = 2
	flag = 1
	while 2 * a <= s:
		v1 = a
		v2 = s - a
		g = math.gcd(v1, v2)
		if g > 1:
			print('Yes')
			print(1, g)
			ans = []
			for j in range(1, n + 1):
				if j != g:
					ans.append(j)
			print(n - 1, *ans)
			flag = 0
			break
		a += 1
	if flag:
		print('No')
if fileoperation:
	sys.stdout = orig_stdout
	sys.stdin = orig_stdin
	inputfile.close()
	outputfile.close()


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	setA = [i for i in range(1, n + 1) if i % 2 == 1]
	setB = [i for i in range(1, n + 1) if i % 2 == 0]
	print('Yes')
	print(len(setA), ' '.join((str(i) for i in setA)))
	print(len(setB), ' '.join((str(i) for i in setB)))


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	l1 = []
	l2 = []
	for i in range(1, n + 1):
		if i % 2 == 0:
			l1.append(i)
		else:
			l2.append(i)
	print('Yes')
	print(str(len(l1)) + ' ' + ' '.join(list(map(str, l1))))
	print(str(len(l2)) + ' ' + ' '.join(list(map(str, l2))))


import math
n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	print(n // 2, end=' ')
	for i in range(1, n + 1):
		if i % 2 == 0:
			print(i, end=' ')
	print('')
	print(math.ceil(n / 2), end=' ')
	for i in range(1, n + 1):
		if i % 2 == 1:
			print(i, end=' ')


def evk(a, b):
	while a != 0 and b != 0:
		if a > b:
			a = a % b
		else:
			b = b % a
	return a + b
n = int(input())
(x, s) = (0, 0)
flag = False
for i in range(1, n + 1):
	s += i
for i in range(1, s // 2 + 1):
	if evk(i, s - i) > 1:
		x = i
		break
if x == 0:
	print('No')
else:
	n1 = n
	a = []
	while x > n1:
		a.append(n1)
		x -= n1
		n1 -= 1
	a.append(x)
	print('Yes')
	print(len(a), end=' ')
	for i in a:
		print(i, end=' ')
	print()
	print(n - len(a), end=' ')
	for i in range(1, n + 1):
		if not i in a:
			print(i, end=' ')


import sys
from collections import defaultdict as dd
from itertools import permutations as pp
from itertools import combinations as cc
from collections import Counter as ccd
from random import randint as rd
from bisect import bisect_left as bl
mod = 10 ** 9 + 7
n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	a = [i + 1 for i in range(n)]
	if n % 2 == 0:
		k = a.pop(n // 2)
		k1 = a.pop(n // 2 - 1)
		print(2, k, k1)
		print(len(a), *a)
	else:
		k = a.pop(n // 2)
		print(1, k)
		print(len(a), *a)


n = int(input())
if n < 3:
	print('No')
elif n % 2 != 0:
	print('Yes')
	print(n // 2, end=' ')
	for i in range(n // 2):
		print((i + 1) * 2, end=' ')
	print()
	print(n // 2 + 1, end=' ')
	for i in range(n // 2 + 1):
		print(i * 2 + 1, end=' ')
elif n % 4 == 0:
	print('Yes')
	p = n // 2
	a = [p]
	b = [p]
	for i in range(p):
		if i % 2 == 0:
			a.append(i + 1)
		else:
			b.append(i + 1)
	for i in range(p):
		if i % 2 != 0:
			a.append(i + 1 + p)
		else:
			b.append(i + 1 + p)
	for i in a:
		print(i, end=' ')
	print()
	for i in b:
		print(i, end=' ')
else:
	print('Yes')
	p = n // 2
	a = [p]
	b = [p]
	for i in range(p):
		a.append(i + 1)
		b.append(i + 1 + p)
	for i in a:
		print(i, end=' ')
	print()
	for i in b:
		print(i, end=' ')
	print()


import math

def main():
	n = int(input())
	s = n * (n + 1) // 2
	for i in range(2, n):
		if math.gcd(i, s - i) > 1:
			print('Yes')
			print(1, i)
			print(n - 1, end=' ')
			for j in range(1, n + 1):
				if j != i:
					print(j, end=' ')
			return
	print('No')
main()


from math import *
from collections import *
import sys
sys.setrecursionlimit(10 ** 9)
n = int(input())
a = ceil(n / 2)
if a == 1:
	print('No')
else:
	print('Yes')
	print(1, a)
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if i == a:
			continue
		print(i, end=' ')
	print()


kek = int(input())
chisla = [i + 1 for i in range(kek)]
(s1, s2) = ([], [])
for i in chisla:
	if i % 2 != 0:
		s1.append(i)
	else:
		s2.append(i)
summms = [sum(s1), sum(s2)]

def gcd(a, b):
	while a != 0 and b != 0:
		if a > b:
			a %= b
		else:
			b %= a
	return a + b
if gcd(summms[0], summms[1]) <= 1:
	print('No')
else:
	print('Yes')
	(s1v, s2v) = (str(s1).replace(',', '').replace('[', '').replace(']', ''), str(s2).replace(',', '').replace('[', '').replace(']', ''))
	print(str(len(s1)) + ' ' + s1v)
	print(str(len(s2)) + ' ' + s2v)


from math import ceil, gcd
n = int(input())
x = ceil(n / 2)
(s1, s2) = ([x], [i for i in range(1, n + 1)])
try:
	s2.remove(x)
	if gcd(sum(s1), sum(s2)) > 1:
		print('Yes')
		print(1, *s1)
		print(n - 1, *s2)
	else:
		print('No')
except ValueError:
	print('No')


from sys import *
import math
n = int(input())
i = 1
(a, b) = ([], [])
l = int(n * (n + 1) / 2)
found = False
while i <= int(l / 2):
	if math.gcd(i, l - i) > 1:
		print('Yes')
		x = int(math.sqrt(2 * i))
		while x * (x + 1) < 2 * i:
			x = x + 1
		k = 1
		while k < x:
			a.append(k)
			k = k + 1
		t = int(x * (x + 1) / 2)
		m = t - i
		if m != 0:
			a.remove(m)
		a.append(x)
		for j in range(1, n + 1):
			if j not in a:
				b.append(j)
		print(len(a), *a, sep=' ')
		print(len(b), *b, sep=' ')
		found = True
		break
	i = i + 1
if not found:
	print('No')


from collections import deque

def gcd(a, b, res):
	if a == b:
		return a * res
	elif a % 2 == 0 and b % 2 == 0:
		return gcd(a // 2, b // 2, 2 * res)
	elif a % 2 == 0:
		return gcd(a // 2, b, res)
	elif b % 2 == 0:
		return gcd(a, b // 2, res)
	elif a > b:
		return gcd(a - b, b, res)
	else:
		return gcd(a, b - a, res)
n = int(input().rstrip())
pSum = [0] * (n + 1)
for i in range(n + 1):
	pSum[i] += i + pSum[i - 1]
if n <= 2:
	print('No')
else:
	s1 = deque([1, 2])
	s2 = deque([x for x in range(3, n + 1)])
	i = 2
	while len(s2) >= 1:
		if gcd(pSum[i] - pSum[0], pSum[n] - pSum[i], 1) != 1:
			print('Yes')
			print(len(s1), ' '.join(map(str, s1)))
			print(len(s2), ' '.join(map(str, s2)))
			break
		s1.append(s2.popleft())
		i += 1
	if len(s2) == 0:
		print('No')


from fractions import gcd
n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	print(n - 1, ' '.join([str(x + 1) for x in range(n - 1)]), sep=' ')
	print(1, n)


from collections import defaultdict
from math import log2, floor
from pprint import pprint
mod = pow(10, 9) + 7

def fun(n):
	if n <= 2:
		print('No')
		return
	else:
		firstlist = []
		secondlist = []
		for i in range(1, n + 1, 2):
			firstlist.append(i)
		for i in range(2, n + 1, 2):
			secondlist.append(i)
		print('Yes')
		print(len(firstlist), *firstlist)
		print(len(secondlist), *secondlist)
	return
n = int(input())
fun(n)


def f(n):
	if n < 3:
		return ['No']
	l = ['Yes']
	l.append('2 1 %d' % (n if n % 2 == 0 else n - 1))
	s2 = [n - 2] + list(range(2, n - 1)) + [n if n % 2 == 1 else n - 1]
	l.append(' '.join(map(str, s2)))
	return l
n = int(input())
[print(r) for r in f(n)]


n = int(input())
if n == 1 or n == 2:
	print('No')
	exit(0)
div = 2
s = n * (n + 1) // 2
while div * div <= s:
	if s % div == 0:
		break
	div += 1
if s % div != 0:
	print('No')
	exit(0)
print('Yes')
print(1, div)
print(n - 1, end=' ')
for i in range(1, n + 1):
	if i == div:
		continue
	print(i, end=' ')


def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(mi())
n = ii()
ok = 1
if n <= 2:
	ok = 0
else:
	s = n * (n + 1) // 2
	for i in range(2, n + 1):
		if s % i == 0:
			x = i
			break
	else:
		ok = 0
if ok:
	print('Yes')
	print(1, x)
	rest = set(range(1, n + 1)) - {x}
	rest = [len(rest)] + list(rest)
	print(*rest)
else:
	print('No')


a = int(input())
if a == 1 or a == 2:
	print('No')
else:
	print('Yes')
	print(1, end=' ')
	b = int((a + 1) / 2)
	print(b)
	print(a - 1, end=' ')
	for k in range(a):
		if k == b - 1:
			continue
		else:
			print(k + 1, end=' ')


def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)
n = int(input())
l1 = []
l2 = []
if n == 1:
	print('No')
	exit()
else:
	for i in range(1, n + 1):
		if i % 2 != 0:
			l1.append(i)
		else:
			l2.append(i)
if gcd(sum(l1), sum(l2)) <= 1:
	print('No')
else:
	print('Yes')
	print(len(l1), *l1)
	print(len(l2), *l2)


n = int(input())

def f(n):
	if n < 3:
		print('No')
		return
	s = str(n - 1)
	if n % 2 == 0:
		k = n // 2
	else:
		k = (n + 1) // 2
	for i in range(1, k):
		s += ' ' + str(i)
	for j in range(k + 1, n + 1):
		s += ' ' + str(j)
	print('Yes')
	print(s)
	print('1' + ' ' + str(k))
	return
f(n)


import math as m
n = int(input())
l1 = []
l2 = []
for i in range(1, n + 1):
	if i % 2 == 0:
		l1.append(i)
	else:
		l2.append(i)
if m.gcd(sum(l1), sum(l2)) <= 1:
	print('No')
else:
	print('Yes')
	print(len(l1), *l1)
	print(len(l2), *l2)


from collections import defaultdict
n = int(input())
if n == 1 or n == 2:
	print('No')
	exit()
else:
	print('Yes')
	if n % 2:
		print(n // 2, end=' ')
		for i in range(1, n + 1):
			if not i % 2:
				print(i, end=' ')
		print()
		print(n // 2 + 1, end=' ')
		for i in range(n + 1):
			if i % 2:
				print(i, end=' ')
	else:
		print(n // 2, end=' ')
		for i in range(1, n + 1):
			if not i % 2:
				print(i, end=' ')
		print()
		print(n // 2, end=' ')
		for i in range(n + 1):
			if i % 2:
				print(i, end=' ')


n = int(input())
if n < 3:
	print('No')
else:
	res = [0] + [0] * (n - 1)
	res2 = [1, n]
	for i in range(1, n):
		res[i] = i
	res[0] = len(res) - 1
	print('Yes')
	print(*res)
	print(*res2)


def div(n):
	d = 2
	while n % d != 0 and d * d <= n:
		d += 1
	if d * d > n:
		return n
	else:
		return d

def solve(n):
	if n <= 2:
		print('No')
		return
	s = n * (n + 1) // 2
	d = div(s)
	print('Yes')
	print(1, d)
	print(n - 1, ' '.join([str(i) for i in range(1, n + 1) if i != d]))
n = int(input())
solve(n)


n = int(input())
s = n * (n + 1) / 2
for i in range(2, n + 1):
	if s % i == 0:
		print('Yes')
		print(*[1, i])
		print(*[n - 1] + [j for j in range(1, n + 1) if i != j])
		exit(0)
print('No')


n = int(input())
elem = range(1, n + 1)
set1 = []
set2 = []
for i in range(1, n + 1):
	if i % 2:
		set1.append(i)
	else:
		set2.append(i)
if n > 2:
	print('Yes')
	if n % 2:
		print(len(set2), *set2)
		print(len(set1), *set1)
	else:
		print(len(set1), *set1)
		print(len(set2), *set2)
else:
	print('No')


from sys import exit
n = int(input())
if n == 1 or n == 2 or n == 0:
	print('No')
	exit()
s = n * (n + 1) // 2
for i in range(2, n + 1):
	if (s - i) % i == 0:
		print('Yes')
		print(1, i)
		print(n - 1, end=' ')
		for j in range(1, i):
			print(j, end=' ')
		for j in range(i + 1, n + 1):
			print(j, end=' ')
		exit()
print('No')


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	l1 = []
	l2 = []
	for x in range(1, n + 1):
		if x % 2 == 0:
			l1.append(x)
		else:
			l2.append(x)
	print('Yes')
	print(len(l1), *l1, sep=' ')
	print(len(l2), *l2, sep=' ')


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	print(1, n)
	print(n - 1, *range(1, n))


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	print('1 {}'.format(n))
	print('{} {}'.format(n - 1, ' '.join([str(x) for x in range(1, n)])))


I = lambda : map(int, input().split())
n = int(input())
if n == 1 or n == 2:
	exit(print('No'))
else:
	print('Yes')
	if n % 2:
		print(n // 2, end=' ')
		print(*[i for i in range(2, n + 1, 2)])
		print(n // 2 + 1, end=' ')
		print(*[i for i in range(1, n + 1, 2)])
	else:
		print(n // 2, end=' ')
		print(*[i for i in range(2, n + 1, 2)])
		print(n // 2, end=' ')
		print(*[i for i in range(1, n + 1, 2)])


def ok(n):
	if n <= 2:
		print('No')
	else:
		print('Yes', '\n', 1, n, '\n', n - 1, end=' ')
		for i in range(1, n):
			print(i, end=' ')
ok(int(input()))


import collections, atexit, math, sys, bisect
sys.setrecursionlimit(1000000)

def getIntList():
	return list(map(int, input().split()))
try:
	import numpy

	def dprint(*args, **kwargs):
		print(*args, **kwargs, file=sys.stderr)
	dprint('debug mode')
except ModuleNotFoundError:

	def dprint(*args, **kwargs):
		pass
inId = 0
outId = 0
if inId > 0:
	dprint('use input', inId)
	sys.stdin = open('input' + str(inId) + '.txt', 'r')
if outId > 0:
	dprint('use output', outId)
	sys.stdout = open('stdout' + str(outId) + '.txt', 'w')
	atexit.register(lambda : sys.stdout.close())
(N,) = getIntList()
total = N * (N + 1) // 2
for i in range(2, N + 1):
	if total % i == 0:
		print('Yes')
		print(1, i)
		print(N - 1, end=' ')
		for j in range(1, N + 1):
			if j == i:
				continue
			print(j, end=' ')
		sys.exit()
print('No')


n = int(input())
if n <= 2:
	print('No')
else:
	a = n * (n + 1) // 2
	ans = 'No'
	p = 0
	for i in range(2, max(int(n ** 0.5) + 1, n + 1)):
		if (a - i) % i == 0:
			ans = 'Yes'
			p = i
			break
	if ans == 'No':
		print(ans)
	else:
		print(ans)
		print(1, p)
		print(n - 1, end=' ')
		for i in range(1, n + 1):
			if i == p:
				continue
			print(i, end=' ')
		print()


n = int(input())

def gcd(a, b):
	while True:
		if a == 0:
			return b
		elif b == 0:
			return a
		if a >= b:
			a = a % b
		elif b > a:
			b = b % a
s_1 = [el for el in range(1, n + 1) if el % 2 == 0]
s_2 = [el for el in range(1, n + 1) if el % 2 != 0]
if gcd(sum(s_1), sum(s_2)) > 1:
	print('Yes')
	print(len(s_1), *s_1)
	print(len(s_2), *s_2)
else:
	print('No')


n = int(input())
if n <= 2:
	print('No')
	exit()
s = n * (n + 1) // 2
k = -1
if n % 2 == 0:
	k = n
else:
	k = n + 1
k //= 2
print('Yes')
print(n - 1, end=' ')
for i in range(1, n + 1):
	if i != k:
		print(i, end=' ')
print('')
print('1 ' + str(k))


n = int(input())
if n < 3:
	print('No')
else:
	for k in range(2, n):
		if (n * n + n) // 2 % k == 0:
			print('Yes')
			print(n // k, end=' ')
			for i in range(k, n + 1, k):
				print(i, end=' ')
			print('\n' + str(n - n // k), end=' ')
			for i in range(1, n + 1):
				if i % k:
					print(i, end=' ')
			break


import math
n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	l = [i for i in range(1, n + 1, 2)]
	j = [i for i in range(2, n + 1, 2)]
	print(len(l), end=' ')
	print(' '.join(map(str, l)))
	print(len(j), end=' ')
	print(' '.join(map(str, j)))


import math
n = int(input())
n1 = n
a = []
z = 0
su = (1 + n) * n // 2
if (n + 1) // 2 % 2 == 0:
	print('Yes')
	print(1, 2)
	print(n - 1, 1, end=' ')
	for i in range(3, n + 1):
		print(i, end=' ')
else:
	for i in range(1, su // 2 + 2):
		if i == su // 2 + 1:
			print('No')
			break
		if math.gcd(i, su - i) > 1:
			z = 1
			break
	if z:
		print('Yes')
		while i > n1:
			i -= n1
			a.append(n1)
			n1 -= 1
		a.append(i)
		print(len(a), end=' ')
		for j in a:
			print(j, end=' ')
		print()
		print(n - len(a), end=' ')
		for j in range(1, n1 + 1):
			if j != i:
				print(j, end=' ')


n = int(input())
if n <= 2:
	print('No')
	exit()
O = []
E = []
for i in range(1, n + 1):
	if i % 2 == 1:
		O.append(i)
	else:
		E.append(i)
print('Yes')
print(len(O), *O)
print(len(E), *E)


n = int(input())
sum = n * (n + 1) / 2
check = 0
if n == 1 or n == 2:
	print('No')
	check = 1
elif sum % 2 == 0:
	print('Yes')
	print(str(1) + ' ' + str(2))
	st = ''
	st += str(n - 1)
	st += ' '
	st += str(1)
	for i in range(3, n + 1):
		st += ' '
		st += str(i)
	print(st)
	check = 1
else:
	j = 3
	while j <= n:
		if sum % j == 0:
			print('Yes')
			print(str(1) + ' ' + str(j))
			st = ''
			st += str(n - 1)
			for i in range(1, n + 1):
				if i != j:
					st += ' '
					st += str(i)
				else:
					continue
			print(st)
			check = 1
			break
		else:
			j += 2
if check == 0:
	print('No')


n = int(input())
if n > 2:
	print('Yes')
	print(' '.join(map(str, [n - 1] + [i + 1 for i in range(n - 1)])))
	print('1 ' + str(n))
else:
	print('No')


n = int(input())
f1 = []
f2 = []
if n == 1 or n == 2:
	print('No')
else:
	for i in range(1, n + 1):
		if i % 2 == 0:
			f1.append(i)
		else:
			f2.append(i)
	print('Yes')
	print(len(f1), *f1)
	print(len(f2), *f2)


import sys
import math
n = int(input())
s = int(n * (n + 1) / 2)
if n < 3:
	print('No')
	sys.exit(0)
A = [i for i in range(1, n + 1)]
s1 = []
limit = math.ceil((s + 1) / 2)
for c in range(2, limit):
	if math.gcd(c, s - c) > 1:
		e = n
		while c > e:
			c = c - e
			s1.append(e)
			e -= 1
		s1.append(c)
		break
if len(s1) < 1 or len(s1) >= n:
	print('No')
	sys.exit(0)
print('Yes')
print(len(s1), end=' ')
for i in s1:
	print(i, end=' ')
print()
s2 = set(A) - set(s1)
print(len(s2), end=' ')
for i in s2:
	print(i, end=' ')
print()


n = int(input())
if n < 3:
	print('No')
else:
	print('Yes')
	s1 = list(range(1, n + 1, 2))
	s2 = list(range(2, n + 1, 2))
	print(str(len(s1)) + ' ' + ' '.join((str(x) for x in s1)))
	print(str(len(s2)) + ' ' + ' '.join((str(x) for x in s2)))


N = int(input())
if N <= 2:
	print('No')
else:
	i = 1
	sum = 0
	while i <= N:
		sum += i
		i += 1
	print('Yes')
	print('1', N)
	i = 1
	d = []
	while i < N:
		d.append(i)
		i += 1
	print(f'{len(d)}', end=' ')
	print(*d)


from sys import stdin
from collections import deque
mod = 10 ** 9 + 7
import sys
sys.setrecursionlimit(10 ** 5)
from queue import PriorityQueue
from bisect import bisect_right
from bisect import bisect_left
from collections import defaultdict
from math import sqrt, factorial, gcd, log2, inf, ceil
import heapq
input = lambda : sys.stdin.readline().rstrip()
from sys import stdin, stdout
from heapq import heapify, heappush, heappop
n = int(input())
set1 = set()
z = n * (n + 1)
z //= 2
set2 = {i for i in range(1, n + 1)}
for i in set2:
	if gcd(z - i, i) > 1:
		set2.remove(i)
		set1.add(i)
		break
if set1 == set():
	print('No')
	exit()
print('Yes')
print(len(set1), *set1)
print(len(set2), *set2)


n = int(input())
if n < 3:
	print('No')
	exit()
else:
	print('Yes')
	print(2, 1, n)
	print(n - 2, end=' ')
	print(*range(2, n))


import sys
from bisect import bisect_left, bisect_right
from collections import deque, Counter
from math import gcd, sqrt, factorial, ceil, log10
from itertools import permutations
inf = float('inf')
mod = 1000000007
mini = 1000000007

def fact(n):
	if n == 0:
		return 1
	p = 1
	d = 10 ** 9 + 7
	for i in range(1, n + 1):
		p = p * i
		p = p % d
	return p

def ncr(n, r):
	d = 10 ** 9 + 7
	num = fact(n)
	den = fact(r) * fact(n - r) % d
	den = pow(den, d - 2, d)
	return num * den % d

def sieve(n):
	prime = [True for i in range(n + 1)]
	lst = [0] * (n + 1)
	p = 2
	while p * p <= n:
		if prime[p]:
			lst[p] = p
			for i in range(p * p, n + 1, p):
				if prime[i] == True:
					prime[i] = False
					lst[i] = p
		p = p + 1
	for i in range(1, n + 1):
		if lst[i] == 0:
			lst[i] = i
	mylist = [0] * (n + 1)
	for i in range(2, n + 1):
		mylist[lst[i]] = mylist[lst[i]] + 1
	return mylist

def binary(number):
	result = 0
	while number:
		result = result + 1
		number = number & number - 1
	return result

def calculate_factors(n):
	hh = [1] * (n + 1)
	p = 2
	while p * p < n:
		if hh[p] == 1:
			for i in range(p * 2, n, p):
				hh[i] = 0
		p += 1
	total = 1
	for p in range(2, n + 1):
		if hh[p] == 1:
			count = 0
			if n % p == 0:
				while n % p == 0:
					n = int(n / p)
					count += 1
				total *= count + 1
	return total

def prime_factors(n):
	i = 2
	factors = set()
	while i * i <= n:
		if n % i:
			i += 1
		else:
			factors.add(n // i)
			n = n // i
			factors.add(i)
	if n > 1:
		factors.add(n)
	return factors

def isPrime(n):
	if n == 2 or n == 3:
		return True
	if n % 2 == 0 or n < 2:
		return False
	for i in range(3, int(n ** 0.5) + 1, 2):
		if n % i == 0:
			return False
	return True

def get_array():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def input():
	return sys.stdin.readline().strip()
n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	print(1, n)
	Arr = [n - 1]
	for i in range(1, n):
		Arr.append(i)
	print(*Arr, sep=' ')


n = int(input())
if n < 3:
	print('No')
else:
	a = [i for i in range(2, n + 1, 2)]
	b = [i for i in range(1, n + 1, 2)]
	print('Yes')
	print(len(a), *a)
	print(len(b), *b)


n = int(input())
if n <= 2:
	print('No')
else:
	lis = [i for i in range(2, n + 1, 2)]
	li = [i for i in range(1, n, 2)]
	if n % 2 != 0:
		li = li + [n]
	print('Yes')
	print(len(lis), *lis)
	print(len(li), *li)


def create_sets(n):
	if n <= 2:
		return 'No'
	else:
		(s1, s2) = ([], [])
		(num, odd) = (1, True)
		while num <= n:
			if odd:
				s1.append(num)
			else:
				s2.append(num)
			num = num + 1
			odd = not odd
		if n % 2 == 0:
			size1 = n // 2
		else:
			size1 = n // 2 + 1
		return '\n        Yes\n        {} {}\n        {} {}\n        '.format(size1, ' '.join(list(map(str, s1))), n - size1, ' '.join(list(map(str, s2))))
n = int(input())
print(create_sets(n))


n = int(input())
if n > 2:
	s = n * (n + 1) // 2
	i = 2
	while s % i != 0:
		i += 1
	print('Yes')
	print(1, i)
	print(n - 1, end=' ')
	for j in range(1, n + 1):
		if i != j:
			print(j, end=' ')
else:
	print('No')


def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)
n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	odds = 0
	evens = 0
	for k in range(1, n + 1, 1):
		if k % 2:
			odds += 1
		else:
			evens += 1
	A = []
	B = []
	for i in range(1, n + 1, 1):
		if i % 2 == 0:
			A.append(i)
	for i in range(1, n + 1, 1):
		if i % 2:
			B.append(i)
	print(len(A), *A)
	print(len(B), *B)


n = int(input())
if n == 1 or n == 0 or n == 2:
	print('No')
elif n % 2 == 0:
	print('Yes')
	print(n // 2, end=' ')
	for j in range(1, n + 1):
		if j % 2 == 0:
			print(j, end=' ')
	print()
	print(n // 2, end=' ')
	for j in range(1, n + 1):
		if j % 2 == 1:
			print(j, end=' ')
elif n % 2 == 1:
	print('Yes')
	print(n // 2, end=' ')
	for j in range(1, n + 1):
		if j % 2 == 0:
			print(j, end=' ')
	print()
	print(n // 2 + 1, end=' ')
	for j in range(1, n + 1):
		if j % 2 == 1:
			print(j, end=' ')


n = int(input())
if n == 1 or n == 2:
	exit(print('No'))
a = []
b = []
for i in range(1, n + 1):
	if i % 2 == 1:
		a.append(i)
	else:
		b.append(i)
print('Yes')
print(n // 2, end=' ')
print(*b)
print(n - n // 2, end=' ')
print(*a)


def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x
n = int(input())
x = [i for i in range(1, n + 1)]
ls1 = []
ls2 = []
for t in x:
	if t % 2 is 0:
		ls1.append(t)
	else:
		ls2.append(t)
if gcd(sum(ls1), sum(ls2)) > 1:
	print('Yes')
	print(len(ls1), *ls1)
	print(len(ls2), *ls2)
else:
	print('No')


a = int(input())
if a < 3:
	print('No')
else:
	print('Yes')
	s = 0
	for i in range(a + 1):
		s = s + i
	for i in range(2, a + 1):
		if (s - i) % i == 0:
			v = i
			break
	print('1', v)
	print(a - 1, end=' ')
	for j in range(1, a + 1):
		if j != v:
			print(j, end=' ')


from math import gcd
n = int(input())
odd = []
even = []
if n <= 2:
	print('No')
else:
	print('Yes')
	print(n - 1, *(i for i in range(1, n)))
	print(1, n)


i = int(input())
if i <= 2:
	print('No')
else:
	total_sum = i * (i + 1) / 2
	alone = None
	if i % 2 == 0:
		alone = i // 2
	else:
		alone = (i + 1) // 2
	print('Yes')
	print('1', alone)
	rest = set(range(1, i + 1))
	rest.remove(alone)
	print('{} {}'.format(i - 1, ' '.join((str(x) for x in rest))))


import math
n = int(input())
sm = n * (n + 1) // 2
if n < 3:
	print('No')
else:
	l = []
	c = 1
	u = sm
	while c < math.sqrt(u):
		c += 1
		while u % c == 0:
			l.append(c)
			u //= c
	if u != 1:
		l.append(u)
	print('Yes')
	y = l[0]
	s1 = set()
	s1.add(y)
	s2 = set(list(range(1, n + 1))) - s1
	print(len(s1), *s1)
	print(len(s2), *s2)


n = int(input())

def p(l):
	print(len(l), end=' ')
	print(*l)
s = n * (n + 1) // 2
for k in range(2, n + 1):
	if s % k == 0:
		print('Yes')
		p([k])
		p([i for i in range(1, n + 1) if i != k])
		break
else:
	print('No')


def gcd(a, b):
	while b != 0:
		(a, b) = (b, a % b)
	return a
n = int(input())
if n <= 2:
	print('No')
	exit(0)
if n % 2 == 0:
	s2 = {1, n}
else:
	s2 = {n}
s1 = set(range(1, n + 1)).difference(s2)
print('Yes')
print(len(s1), *s1)
print(len(s2), *s2)


from math import gcd
n = int(input())
k = -1
sum1 = n * (n + 1) // 2
for i in range(1, n + 1):
	if gcd(i, sum1 - i) > 1:
		k = i
		break
if k != -1:
	w = [str(j) for j in range(1, n + 1) if j != k]
	p = ' '.join([str(len(w))] + w)
	print('Yes\n1 {}\n{}'.format(k, p))
else:
	print('No')


def gcd(a, b):
	if a % b == 0:
		return b
	return gcd(b, a % b)
n = int(input())
s1 = []
s2 = []
if n == 1 or n == 2:
	print('No')
else:
	for i in range(1, n + 1):
		if i & 1:
			s1.append(i)
		else:
			s2.append(i)
	if gcd(sum(s1), sum(s2)) == 1:
		print('No')
	else:
		print('Yes')
		print(len(s1), *s1)
		print(len(s2), *s2)


n = int(input())
if n <= 2:
	print('No')
else:
	print('Yes')
	print(1, (n + 1) // 2)
	ans = []
	for i in range(1, n + 1):
		if i != (n + 1) // 2:
			ans.append(i)
	print(n - 1, *ans)


from math import *
import sys
input = sys.stdin.buffer.readline
n = int(input())
s = n * (n + 1) // 2
if n <= 2:
	print('No')
else:
	print('Yes')
	ans1 = 0
	if n == n / 2:
		ans1 = n // 2
	else:
		ans1 = (n + 1) // 2
	print('1', ans1)
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if i != ans1:
			print(i, end=' ')
		else:
			continue


n = int(input())
if n == 1 or n == 2:
	print('No')
else:
	print('Yes')
	s = n * (n + 1) / 2
	if s % 2 == 0:
		ranking = list(range(1, n + 1))
		ranking.remove(2)
		print('1 2')
		ans = str(len(ranking))
		for i in ranking:
			ans = ans + ' ' + str(i)
		print(ans)
	elif n % 2 != 0:
		ranking = list(range(1, n))
		print('1 ' + str(n))
		ans = str(len(ranking))
		for i in ranking:
			ans = ans + ' ' + str(i)
		print(ans)
	else:
		ranking = list(range(1, n + 1))
		ranking.remove(int(n / 2))
		print('1 ' + str(int(n / 2)))
		ans = str(len(ranking))
		for i in ranking:
			ans = ans + ' ' + str(i)
		print(ans)


from math import sqrt
import sys
n = int(sys.stdin.readline())
x = n
n = n * (n + 1) // 2
p = 0
if n % 2:
	s = int(sqrt(n)) + 1
	for i in range(3, s, 2):
		if n % i == 0:
			p = i
			break
else:
	p = 2
if not p:
	print('No')
else:
	print('Yes')
	print(1, p)
	print(x - 1, end=' ')
	for i in range(1, x + 1):
		if i != p:
			print(i, end=' ')


import sys
import bisect
from collections import Counter
read_int = lambda : int(sys.stdin.readline())
read_ints = lambda : map(int, sys.stdin.readline().split())
read_int_list = lambda : list(read_ints())
read = lambda : sys.stdin.readline().strip()
read_list = lambda : sys.stdin.readline().split()

def main():
	n = read_int()
	(s1, s2) = ([], [])
	if n < 3:
		print('No')
		return
	elif n % 2 == 1:
		(s1, s2) = (list(range(1, n)), [n])
	else:
		s1 = [i for i in range(1, n + 1, 2)]
		s2 = [i for i in range(2, n + 1, 2)]
	print('Yes')
	print(len(s1), *s1)
	print(len(s2), *s2)
main()


n = int(input())
e = []
o = []
if n == 1 or n == 2:
	print('No')
elif n > 2:
	for i in range(1, n + 1):
		if i % 2 == 0:
			e.append(i)
		else:
			o.append(i)
	print('Yes')
	print(len(e), end=' ')
	for i in e:
		print(i, end=' ')
	print()
	print(len(o), end=' ')
	for i in o:
		print(i, end=' ')


import math
n = int(input())
s = [i for i in range(1, n + 1)]
sum1 = s[0]
p = sum(s)
g = 0
p = p - sum1
for i in range(0, n - 1):
	if math.gcd(sum1, p) > 1:
		index = i
		g = 1
		break
	sum1 += s[i + 1]
	p -= s[i + 1]
if g == 1:
	print('Yes')
	s1 = s[0:index + 1]
	print(len(s1), end=' ')
	print(' '.join((str(e) for e in s[0:index + 1])))
	s2 = s[index + 1:]
	print(len(s2), end=' ')
	print(' '.join((str(e) for e in s[index + 1:])))
if g != 1:
	print('No')


import io
import sys
from math import gcd

def solve(n):
	return [list(range(1, n + 1, 2)), list(range(2, n + 1, 2))]
inp = sys.stdin
n = int(inp.readline().strip())
if n <= 2:
	print('No')
else:
	print('Yes')
	ans = solve(n)
	print(len(ans[0]), ' '.join([str(x) for x in ans[0]]))
	print(len(ans[1]), ' '.join([str(x) for x in ans[1]]))


n = int(input())

def gcd(x, y):
	if x > y:
		a = x
		b = y
	else:
		a = y
		b = x
	while b:
		(a, b) = (b, a % b)
	return a
s1 = [1]
s2 = [2]
s_1 = 1
s_2 = 2
if n == 1 or n == 2:
	print('No')
else:
	for i in range(3, n + 1):
		if gcd(s_2 + i, s_1) > 1:
			s2.append(i)
			s_2 += i
		elif gcd(s_1 + i, s_2) > 1:
			s1.append(i)
			s_1 += i
	if gcd(s_1, s_2) <= 1:
		print('No')
	else:
		print('Yes')
		print(len(s1), ' ', end='')
		for i in s1:
			print(i, ' ', end='')
		print()
		print(len(s2), ' ', end='')
		for i in s2:
			print(i, ' ', end='')


import time as t
n = int(input())
f = 0
for i in range(2, n + 1):
	if n * (n + 1) // 2 % i == 0 and n * (n + 1) // 2 // i > 1:
		print('Yes')
		print(1, i)
		ans = ''
		for j in range(1, n + 1):
			if j != i:
				ans += str(j) + ' '
		print(n - 1, ans)
		f = 1
	if f:
		break
if f == 0:
	print('No')


import sys
import math

def getLowestDivisor(n):
	for i in range(2, n):
		if i ** 2 > n:
			return -1
		if n % i == 0:
			return i
	return -1
lines = sys.stdin.read().splitlines()
n = [int(x) for x in lines[0].split()][0]
sum = n * (n + 1) // 2
divisor = getLowestDivisor(sum)
if divisor == -1:
	print('No')
else:
	print('Yes')
	firstSum = sum // divisor
	lastNum = n
	firstSeq = []
	secondSeq = []
	while firstSum - lastNum > 0:
		firstSeq.append(lastNum)
		firstSum -= lastNum
		lastNum -= 1
	if firstSum != 0:
		firstSeq.append(firstSum)
	for i in range(1, lastNum + 1):
		if i != firstSum:
			secondSeq.append(i)
	print(len(firstSeq), end=' ')
	for i in firstSeq:
		print(' ' + str(i), end=' ')
	print()
	print(len(secondSeq), end=' ')
	for i in secondSeq:
		print(' ' + str(i), end=' ')
	print()


MOD = 10 ** 9 + 7
I = lambda : list(map(int, input().split()))
(n,) = I()
l1 = []
l2 = []
for i in range(1, n + 1, 2):
	l1.append(i)
	if i + 1 <= n:
		l2.append(i + 1)
from math import gcd
if gcd(sum(l1), sum(l2)) > 1:
	print('Yes')
	print(len(l1), *l1)
	print(len(l2), *l2)
else:
	print('No')


a = []
import math

def pr(n):
	while n % 2 == 0:
		a.append(2)
		n = n // 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			a.append(i)
			n = n // i
	if n > 2:
		a.append(n)
n = int(input())
pr(n * (n + 1) // 2)
if len(a) <= 1:
	exit(print('No'))
else:
	print('Yes')
	print(1, a[0])
	print(n - 1, end=' ')
	for i in range(1, n + 1):
		if i != a[0]:
			print(i, end=' ')


def main():
	num = int(input())
	if num < 3:
		print('No')
		return
	sum = num * (num + 1) // 2
	for i in range(2, num // 2 + 2):
		if (sum - i) % i == 0:
			print('Yes')
			print('1 %d' % i)
			print(printRange(num, i))
			return
	print('No')

def printRange(n, target):
	s = str(n - 1)
	for i in range(1, n + 1):
		if i != target:
			s += ' '
			s += str(i)
	return s
main()


from math import gcd

def create_primes(n):
	arr = [1] * (n + 1)
	arr[0] = 0
	arr[1] = 0
	for x in range(2, int(n ** 0.5) + 1):
		if arr[x] == 1:
			arr[x * x::x] = [0 for i in arr[x * x::x]]
	return [x for x in range(len(arr)) if arr[x] == 1]
primes = create_primes(22500)

def solve():
	n = int(input())
	if n < 3:
		print('No')
		return
	sum_ = n * (n + 1) // 2
	i = 0
	while primes[i] <= n // 2 + 1:
		if gcd(sum_ - primes[i], primes[i]) > 1:
			print('Yes')
			print(1, primes[i])
			print(n - 1, ' '.join((str(k) for k in range(1, n + 1) if k != primes[i])))
			return
		i += 1
	print('No')
solve()