One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed *w* kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.

Pete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.
The first (and the only) input line contains integer number *w* (1 ≤ *w* ≤ 100) — the weight of the watermelon bought by the boys.


#Write a function that takes an input string and returns the number of vowels in the string.
"""
def Vowels(inp):
    lst = []
    for vowel in inp:
        lst.append(vowel)
    print(len(lst))

Vowels("Hello")
"""
#Write a function that takes a list of numbers and returns the sum of all even numbers in the list.
import math
import queue

'''
def evenNum(inp):
    ans = 0
    for number in inp:
        if number % 2 == 0:
            ans += number
    print(ans)

evenNum([1,2,3,4,5,6,7,8]) # 2 + 4 + 6 + 8 = 20
'''

#Write a function that takes two lists and returns a new list containing only the elements that are common to both lists.
'''
def common_elements(list1 , list2):
    common = []
    for i in list1:
        for j in list2:
            if i == j:
                common.append(i)

    print(common)


common_elements([1,2,3] , [5 , 3 , 1])

'''

#Write a function that takes a string as input and returns the reverse of the string
'''
def reverse(inp):
    vowel_list = []
    for i in inp:
        vowel_list.append(i)
    vowel_list.reverse()
    word = ''.join(vowel_list)
    print(word)

reverse("Hello") # olleH
'''
#Write a function that takes a list of numbers and returns the maximum number in the list.
"""
def maxNumber(inp):
    max_num = max(inp)
    print(max_num)

maxNumber([1,4,2,3])
"""

#Write a function that takes a list of strings and returns the shortest string in the list.
'''
def shortest_string(inp):
    shortest_word = inp[0]
    for i in inp:
        if len(i) < len(shortest_word):
            shortest_word = i

    print(shortest_word)


shortest_string(["Hello" , "hi" , "goodbye" , "o"])
'''

#Write a function that takes a list of numbers and returns a new list containing only the prime numbers in the original list.
'''
import math

def find_primes(numbers):
    primes = []
    for number in numbers:
        if number < 2:
            continue
        is_prime = True
        for i in range(2, int(math.sqrt(number) + 1)):
            if number % i == 0:
                is_prime = False
                break
        if is_prime:
            primes.append(number)

    print(primes)

find_primes([2 , 4 , 3 , 6 , 5])

'''

#Write a function that takes a list of integers and returns a new list containing the same integers, but sorted in ascending order.
'''
def sorted_nums(inp):
    sorted_list = sorted(inp)
    print(sorted_list)

sorted_nums([3,4,25,1 , 0])
'''

#Write a function that takes a list of integers and returns the second largest number in the list.
'''
def second_largest(inp):
    inp = sorted(inp)
    print(inp[len(inp) -2])

second_largest([5,4,8 , 7])

'''

#Write a function that takes a string as input and returns the number of times each letter appears in the string.

'''
def letters_num(string):
    letters_dict = {}
    for i in string:
        if i.isalpha():
            if i.lower() in letters_dict:
                letters_dict[i.lower()] += 1
            else:
                letters_dict[i.lower()] = 1
    print(letters_dict)

letters_num("Moazm")
'''

# Check if the two strings are anagrams
'''
def anagram(str1 , str2):
    str1_clean = str1.replace(" " , "").lower()
    str2_clean = str2.replace(" " , "").lower()

    str1_sorted = sorted(str1_clean)
    str2_sorted = sorted(str2_clean)

    if str1_sorted == str2_sorted:
        print("anagram")
    else:
        print("not anagram")

anagram('LIsten' , 'silEnt')
'''

# Problem sheet 1  G (team)
'''

n = input()
n = int(n)
can_answer = 0
for i in range(n):
    a = input().split(" ")
    know = 0
    for j in a:
        if j == "1":
            know += 1

    if know >= 2:
        can_answer += 1


print(can_answer)

'''
# Problem sheet 1  H (Bit++)
'''
n = input()
n = int(n)
x = 0

for i in range(n):
    a = input()
    if "++" in a:
        x += 1
    elif "--" in a:
        x-= 1

print(x)

'''



"""
n = input()
n = int(n)
a = input().split()
a.sort()
a = [int(x) for x in a]
for i in range(n):
    print(a[i] , end = " ")
"""

# Problem sheet 1 j (Wet Shark odd and even)
"""
n = input() 
n = int(n)
sum = 0
odd = []
a = input().split()
a = [int(x) for x in a]
for i in range(n):
    sum += a[i]
    if a[i] % 2 == 1: # odd
        odd.append(a[i])

if sum % 2 == 0:
    print(sum)

elif sum % 2 == 1:
    sum -= min(odd)
    print(sum)

"""


# Problem sheet 1 F (Ring Ring)
"""
a ,b , c = input().split()
mylist = [a , b , c]
mylist = [int(x) for x in mylist]
a = int(a)
b = int(b)
c = int(c)
mylist.sort()
ans = int(mylist[0]) + int(mylist[1])
print(ans)
"""


# Problem sheet 1 I (Gravity Flip)

"""
n = input()
n = int(n)
a = input().split()
a = [int(x) for x in a]
a.sort()
for i in range(n):
    print(a[i] , end=" ")
"""

#Children and Candies  Sheet 2


'''
# n = input()
# n = int(n)
# sum = 0
#
# for i in range(1 , n + 1):
#     sum += i
#
# print(sum)
#
# # Time Complexity : O(n)
'''

#Again Twenty Five!

"""
n = input()
n = int(n)

print(25)

# Time Complexity : O(1)
"""

#AC or WA

"""
n , m = input().split()
n = int(n)
m = int(m)

if m == n:
    print("Yes")
else:
    print("No")

# Time Complexity : O(1)

"""

#Calculating Function

"""
import math
n = input()
n = int(n)
ans = 0

if n % 2 == 0:
    ans = math.ceil(n / 2)
else :
    ans = -math.ceil(n / 2)

print(ans)

# Time Complexity : O(1)
"""

#ABC Swap

"""

x , y, z = input().split()
x = int(x)
y = int(y)
z = int(z)
print(z , x , y)

#Time Complexity : O(1)

"""

# F - Stones on the Table

"""

n = input()
n = int(n)
s = list( map(str , input()) )
stone = 0
for i in range(1 , n):
    if s[i] == s[i - 1]:
        stone += 1

print(stone)

# Time Complexity : O(n)

"""

# G - Palindrome with leading zeros

"""

n = list(map(int , input()))

while len(n) > 1 and n[len(n) - 1] == 0:
    n.pop()

m = n.copy()
m.reverse()

if n == m:
    print("Yes")
else:
    print("No")

# Time Complexity : O(n)


"""




# 1) Write a Python program to find the sum of all even numbers from 1 to 100.
"""
def allEvenNum():
    for i in range(1 , 100 + 1):
        if i % 2 == 0:
            print(i)

allEvenNum()
"""

# 2) Write a Python program to determine whether a given year is a leap year or not.
"""
def isLeapYear(year):
    leap_year = False
    if year % 4 == 0  and (year % 100 != 0 or year % 400 == 0):
        leap_year = True

    print(leap_year)

isLeapYear(2024)
"""

# 3) Write a Python program to generate the Fibonacci sequence up to a given number.

"""
def Fibonacci_sequence(num):
    mylist = [0 , 1]
    for i in range(num):
        if mylist[i + 1] == num:
            break
        new_element: int = mylist[i] + mylist[i + 1]
        mylist.append(new_element)

    print(mylist)

Fibonacci_sequence(21)

"""

# 4) Write a Python program to find the largest element in a list.
"""
def largest_element(list):
    largest = list[0]
    for i in list:
        if len(i) > len(largest):
            largest = i

    print(largest)

largest_element(["hi" , "goodbye" , "hello"])
"""

# 5) Write a Python program to remove duplicates from a list.
"""

def remove_duplicates(mylist):
    new_list = []
    for i in mylist:
        if i  not in new_list:
            new_list.append(i)

    print(new_list)
remove_duplicates(["hi" , "hello" ,"hello", "hi" , "goodbye" , "goodbye"])

"""

# 6) Write a Python program to find the factors of a given number.

"""

def find_factors_of(number):
    factors = []
    for i in range(1 ,number + 1):
        if 12 % i == 0:
            factors.append(i)

    print(factors)

find_factors_of(12)

"""

# 7) Write a Python program to check if a given string is a palindrome.
"""

def is_palindrome(string):
    string_list = []
    for i in string:
        string_list.append(i)

    reversed_list = string_list.copy()
    reversed_list.reverse()

    if string_list == reversed_list:
        print("Palindrome")
    else:
        print("Not Palindrome")

is_palindrome("racecar")

"""

# 8) Write a Python program to find the common elements between two lists.

"""

def common_element(list1 , list2):
    common_list = []
    for i in list1:
        for j in list2:
            if i == j:
                common_list.append(i)

    print(common_list)

common_element(["Hello" , "Goodbye" , "moaz"] , ["Goodbye" , "good morning" , "good afternoon" , "moaz" ])


"""

# HackerRank

# 5
"""

n = input()
n = int(n)

for i in range(n):
    print(i ** 2)

"""

#7

"""

n = input()
n = int(n)

for i in range(1 , n + 1):
    print(i , end=" ")

"""

# H - Dice Tower


# A - Array

"""

n = input()
n = int(n)

list = input().split()
list = [int(x) for x in list]

negative = []
positive = []
zero = []

for i in range(n):
    if list[i] < 0 :
        negative.append(list[i])

    elif list[i] > 0:
        positive.append(list[i])

    elif list[i] == 0:
        zero.append(list[i])

if len(positive) == 0 and len(negative) > 2:
    positive.append(negative.pop())
    positive.append(negative.pop())

if len(negative) % 2 == 0:
    zero.append(negative.pop())

print(len(negative) , *negative)
print(len(positive) , *positive)
print(len(zero) , *zero)


# Time Complexity : O(n)

"""

# B - Left Rotation

"""
n , d = input().split()

n = int(n)
d = int(d)

list = input().split()

list = [int(x) for x in list]

for i in range(d):
    number = list.pop(0)
    list.append(number)

print(*list)

# Time complexity : O(d)


"""

# C - Team Olympiad
"""


n = input()
n = int(n)

mylist = input().split()
mylist = [int(x) for x in mylist]

list1 = []
list2 = []
list3 = []

for i in range(n):

    if mylist[i] == 1:
        list1.append(i + 1)

    if mylist[i] == 2:
        list2.append(i + 1)

    if mylist[i] == 3:
        list3.append(i + 1)

number_of_teams = min(len(list1) , len(list2) , len(list3))
print(number_of_teams)


for j in range(number_of_teams):
    print(list1[j] , list2[j] , list3[j])

# Time Complexity : O(n)

"""

# D - Launch of Collider

"""

n = input()
n = int(n)

str = input()
list = input().split()
list = [int(x) for x in list]
list2 = []
for i in range(n - 1):
    if str[i] == "R" and str[i + 1] == "L":
        ans = list[i + 1] - list[i]
        list2.append(ans // 2)

if len(list2) == 0:
    print(-1)

else:
    print(min(list2))

# Time Complexity : O(n)

"""


# E - Tanya and Stairways

"""
n = input()
n = int(n)

list = input().split()
list = [int(x) for x in list]

list2 = []
for i in range(1 , n):

    if list[i] == 1:
        list2.append(list[i - 1])

list2.append(list[-1])

print(len(list2))
print(*list2)


#Time Complexity : O(n)

"""

# F - Jzzhu and Children





# G - Angry Students

""""

t = input()
t = int(t)

for x in range(t):

    n = input()
    n = int(n)

    string = input()

    s = []
    count = 0

    for i in range(n - 1, -1, -1):
        if string[i] == "P":
            count += 1
        else:
            s.append(count)
            count = 0

    mx = max(s)

    print(mx)

#Time Complexity : O(t)

"""

# Jzzhu and Children

"""

from queue import Queue

n , m = input().split()

n = int(n)

m = int(m)

mylist = list(map(int , input().split()))

que = Queue()

for index in range(len(mylist)):
    que.put([mylist[index] , index + 1])

pos = 0
while not que.empty():
    element = que.get()
    element[0] -= m

    if element[0] > 0:
        que.put(element)
    else:
        pos = element[1]

print(pos)

#Time Complexity : O(n)



"""

# Easy Stack

"""

n = input()
n = int(n)

stack = []

for i in range(n):
    mylist = list(map(int , input().split() ))
    if mylist[0] == 1:
        stack.append(mylist[1])

    elif mylist[0] == 2:
        if stack:
            stack.pop()
        else:
            print("Empty!")

    elif mylist[0] == 3:
        if stack:
            print(stack[-1])
        else:
            print("Empty!")

# Time Complexity : O(n)



"""

# H - Ada and Queue

"""
n = input()
n = int(n)

arr = []

rev = False


for i in range(n):
    mylist = input().split()

    if mylist[0] == "back":
        if len(arr) > 0:
            if rev is False:
                print(arr.pop())
            else:
                print(arr.pop(0))
        else:
            print("No job for Ada?")


    elif mylist[0] == "front":
        if len(arr) > 0:
            if rev is False:
                print(arr.pop(0))
            else:
                print(arr.pop())
        else:
            print( "No job for Ada?")


    elif mylist[0] == "reverse":
        if rev == False:
            rev = True
        else:
            rev = False


    elif mylist[0] == "push_back":
        if rev is False:
            arr.append(mylist[1])
        else:
            arr.insert(0, mylist[1])


    elif mylist[0] == "toFront":
        if rev is False:
            arr.insert(0, mylist[1])
        else:
            arr.append(mylist[1])

# Time Complexity : O(n)



"""


#A - Easy Queue

"""


from queue import Queue

que = Queue()

n = input()
n = int(n)
elements = 0

for i in range(n):
    mylist = list(map(int , input().split()))

    if mylist[0] == 1:
        que.put(mylist[1])
        elements += 1

    elif mylist[0] == 2:
        if elements > 0:
            que.get()
            elements -= 1

    elif mylist[0] == 3:
        if elements > 0:
            print(que.queue[0])
        else:
            print("Empty!")

#Time Complexity : O(n)

"""


#B - Easy Stack

"""


stack = []

n = input()
n = int(n)

for i in range(n):
    mylist = list(map(int , input().split()))

    if mylist[0] == 1:
        stack.append(mylist[1])

    elif mylist[0] == 2:
        if len(stack) > 0:
            stack.pop()

    elif mylist[0] == 3:
        if len(stack) > 0:
            print(stack[-1])
        else:
            print("Empty!")

# Time Complexity : O(n)

"""

# C - Left Rotation

"""

from queue import Queue

n ,d = input().split()

n = int(n)

d = int(d)

mylist = list(map(int , input().split()))

que = Queue()

for num in mylist:
    que.put(num)

for i in range(d):
    element = que.get()
    que.put(element)

for j in range(que.qsize()):
    element = que.get()
    print(element , end = " ")
    

# Time Complexity : O(n)

"""

# D - Jzzhu and Children

"""


from queue import Queue

que = Queue()

n , m = input().split()

n = int(n)

m = int(m)

mylist = list(map(int , input().split()))

for i in range(len(mylist)):
    que.put( [mylist[i] , i + 1] )

pos = 0
while not que.empty():
    element = que.get()
    element[0] -= m

    if element[0] > 0 :
        que.put(element)
    else:
        pos = element[1]

print(pos)

#time Complexity : O(n)

"""

# E - Parentheses Balance

"""

n = input()
n = int(n)

for i in range(n):
    ans = True

    s = input()
    stack = []

    for c in s:
        if c == "(" or c == "[":
            stack.append(c)

        elif c == ")":
            if len(stack) == 0:
                ans = False
                break

            if stack[-1] == "(":
                stack.pop()
            else:
                ans = False
                break

        elif c == "]":

            if len(stack) == 0:
                ans = False
                break

            if stack[-1] == "[":
                stack.pop()
            else:
                ans = False
                break

    if len(stack) > 0:
        ans = False
    
    if ans is True:
        print("Yes")
    else:
        print("No")


# Time Complexity : O(n)



"""

# F - Alternating Current


"""

s = input()

stack = []

for i in s:
    if len(stack) == 0:
        stack.append(i)

    elif i == "+" and stack[-1] == "+":
        stack.pop()

    elif i == "-" and stack[-1] == "-":
        stack.pop()

    else:
        stack.append(i)


if len(stack) == 0:
    print("Yes")
else:
    print("No")

# Time Complexity : O(n)


"""

# G - Sorting Queries

"""
from queue import Queue
from queue import PriorityQueue

que = Queue()
pq = PriorityQueue()
n = input()
n = int(n)


for i in range(n):
    mylist = list(map(int , input().split()))

    if mylist[0] == 1:
        que.put(mylist[1])

    if mylist[0] == 2:
        print(que.get())

    if mylist[0] == 3:
        for j in que.queue :
            pq.put(j)

        for x in range(que.qsize()):
            que.get()

        while not pq.empty():

            que.put(pq.get())


# Time Complexity : O( n*log(n) )

"""

# A - Boy or Girl

"""

s = input()

my_set = set()

for i in s:
    my_set.add(i)

if len(my_set) % 2 == 1:
    print("IGNORE HIM!")
else:
    print("CHAT WITH HER!")

# Time Complexity : O(n)

"""

# B - Anton and Letters

"""
s = input()
my_set = set()

for i in s:
    if i.isalpha() is True:
        my_set.add(i)

print(len(my_set))

# Tine Complexity : O(n)
"""

# C - Keyboard

"""


keyboard = "qwertyuiopasdfghjkl;zxcvbnm,./"
condition = input()

s = input()
my_map = {}

if condition == "R":

    for i in range(len(s)):
        for j in range(len(keyboard)):
            if s[i] == keyboard[j]:
                my_map[s[i]] = keyboard[j - 1]


elif condition == "L":
    for i in range(len(s)):
        for j in range(len(keyboard)):
            if s[i] == keyboard[j]:
                my_map[s[i]] = keyboard[j + 1]

for i in s:
    print(my_map.get(i) , end="")

# Time Complexity : O(n^2)

"""

# D - Registration System

"""

n = input()
n = int(n)

mymap = {}

for i in range(n):
    s = input()
    if s in mymap:
        mymap[s] += 1
        print(f'{s}{mymap.get(s)}')
    else:
        mymap[s] = 0
        print("OK")

# Time Complexity : O(n)

"""

# E - Chat Order

"""

n = input()
n = int(n)
stack = []

for i in range(n):
    s = input()

    if s in stack:
        stack.pop(stack.index(s))

    stack.insert(0 , s)

for i in stack:
    print(i)

# Time Complexity : O(n)


"""

w = input()
w = int(w)

while w % 2 ==0 :
    w-= 2
    if w == 0:
        print("YES")
        break


