import itertools as iter
import collections as coll
import heapq as hq
import bisect as bis
from decimal import Decimal as dec
from functools import cmp_to_key
import math
import sys
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10 ** 6)
inp = sys.stdin.readline
input = lambda : inp().rstrip()
getN = lambda : int(inp())
getNs = lambda : map(int, inp().split())
getList = lambda :list(map(int, inp().split()))
getStrs = lambda n : [input() for _ in [0] * n]
def yexit(): print("Yes"); exit(0)
def nexit(): print("No"); exit(0)
pi = 3.141592653589793
mod = 1000000007
MOD = 998244353
INF = 4611686018427387903
dx = [1, 0, -1, 0];	dy = [0, 1, 0, -1]
#di = coll.defaultdict(int)


# Tonelli-Shanks's Algorithm
import random
class TonelliShanks:
	def __init__(self, a, p):
		self.a = a
		self.p = p
		self.x = self.tonelli_shanks()

	def get_inv(self, _a, _p):
		return pow(_a, _p - 2, _p)

	def euler_criterion(self, _a, _p):
		return (pow(_a, (_p - 1) >> 1, _p) == 1)

	# x^2 \equiv a (mod p) -> x
	def tonelli_shanks(self) :
		self.a %= self.p
		if(self.a == 0):
			return 0
		if(self.p == 2):
			return self.a
		if not(self.euler_criterion(self.a, self.p)):
			return -1

		b = 1
		while(self.euler_criterion(b, self.p)):
			b = random.randint(1, self.p - 1)

		q = self.p - 1
		r = 0
		while not(q & 1):
			r += 1
			q >>= 1
		x = pow(self.a, (q + 1) >> 1, self.p)
		b = pow(b, q, self.p)

		s = 2
		while(pow(x, 2, self.p) != self.a):
			e = self.get_inv(self.a, self.p) * pow(x, 2, self.p) % self.p
			if(pow(e, 1 << (r - s), p) != 1):
				x *= b
				x %= self.p
			b = pow(b, 2, self.p) % self.p
			s += 1
		return x


"""
Main Code
"""

p = getN()

K = (p - 1) >> 1
a = p - abs(-4 * K * K - 16 * K + 1) % p
x = TonelliShanks(a, p).x
if(x == -1 or (x & 1) == 0):
	print("NO")
else:
	print("YES")