import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
def mul_quad(a, b, theta, p):
    x = a[0] * b[0] + theta * a[1] * b[1]
    x %= p
    y = a[0] * b[1] + a[1] * b[0]
    y %= p
    return x, y

def pow_quad(a, n, theta, p):
    res = (1, 0)
    while n:
        if n & 1:
            res = mul_quad(res, a, theta, p)
        a = mul_quad(a, a, theta, p)
        n >>= 1
    return res

def cipolla(a, p):
    a %= p
    if p == 2:
        return a
    if a == 0:
        return 0
    if pow(a, (p - 1) // 2, p) != 1:
        return -1
    c = 0
    while pow((c * c - a) % p, (p - 1) // 2, p) == 1:
        c += 1
    theta = (c * c - a) % p
    res = pow_quad((c, 1), (p + 1) // 2, theta, p)
    return res[0]



p = ni()
k = (p-1)//2
z = cipolla((1-4*k*k-16*k)%p, p)
if z == -1:
    NO()
else:
    YES()