import typing
import sys

# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np

# sys.setrecursionlimit(10000001)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353


def ni(): return int(sys.stdin.buffer.readline())
def ns(): return map(int, sys.stdin.buffer.readline().split())
def na(): return list(map(int, sys.stdin.buffer.readline().split()))


# ===CODE===

def main():
    a = ni()

    flg = False
    for i in range(3, int(math.sqrt(a))+1, 2):
        if a % i == 0:
            flg = True

    for i in range(4, int(math.sqrt(a))+1, 2):
        if a % i == i//2:
            flg = True

    print("YES" if flg else "NO")


if __name__ == '__main__':
    main()