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.

Input

The first (and the only) input line contains integer number w (1 ≤ w ≤ 100) — the weight of the watermelon bought by the boys.

Output

Print YES, if the boys can divide the watermelon into two parts, each of them weighing even number of kilos; and NO in the opposite case.

Examples

Input

8


Output

YES

Note

For example, the boys can divide the watermelon into two parts of 2 and 6 kilos respectively (another variant — two parts of 4 and 4 kilos).
N= int(input())
if(N%2==0 and N!=2):
	print("YES")
else:
	print("NO")





'''
N, Q = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
for q in range(Q):
	l = list(map(int, input().split()))
	if(len(l)==2):
		counter = 0
		for i in range(l[1]-1,N):
			a[i] += b[counter]	
			counter += 1
	elif(len(l)==3):
		s = 0
		for i in range(l[1]-1,l[2]):
			s += a[i]
		print(s)
'''

'''
T = int(input())
for t in range(T):
	n,k = map(int, input().split())
	l = list(map(int, input().split()))
	ans = []
	result = 0
	for i in range(len(l)):
		for j in range(i,n):
			result = 0
			for k in range(i,j+1):
				result += l[k]
			ans.append(result)
	ans.sort()
	print(ans)
'''


'''
#MINEAT
from math import * 
T = int(input())
for t in range(T):
	n,h = map(int, input().split())
	l = list(map(int, input().split()))
	minn = ceil(float(sum(l))/float(h))
	l1 = l
	count = 0
	h1 = 0
	check1 = 0
	temp = 0
	f = 0
	l.sort()
	r = l[::-1]
#	print(r)
	if(n==h):
		print(r[0])
	elif(h>=sum(r)):
		print(1)
	elif(h<sum(r)):
		
		for i in range(1000):
			index = 0
			h1 = h
			r = l[::-1]
			while(h1!=0):
				r[index] = r[index]-minn-i
				if(r[index]<=0):
					r.pop(index)
				if(len(r)==0):
					f = 1
					break
				h1 -= 1
#				print(r,h1)
			if(f==1):
				print(minn+i)
				break
'''
'''
z = int(input())
for t in range(z):
	n = int(input())
	finger = list(map(int, input().split()))
	front = list(map(int, input().split()))
	back = front[::-1]
	f = 0
	b = 0
	for i in range(len(finger)):
		if(finger[i]<=front[i]):
			f = 1
		else:
			f = 0
			break

	for i in range(len(finger)):
		if(finger[i]<=back[i]):
			b = 1
		else:
			b = 0
			break

	if(f==1 and b==1):
		print("both")
	elif(f==1 and b!=1):
		print("front")
	elif(f!=1 and b==1):
		print("back")
	else:
		print("none")
'''


'''
def func(l1,l2):
	temp1 = []
	temp2 = []
	f = 0
	if(l1==l2):
		f = 1
	if(f==0):
		for i in l1:
			if(i not in l2):
				temp1.append(i)
		temp1.sort()

		for i in l2:
			if(i not in l1):
				temp2.append(i)
		temp2.sort()
		
		if(len(temp1)!=0):
			print("person1 : ",end="")
			for i in range(len(temp1)):
				print(temp1[i],end=" ")
		elif(len(temp1)==0):
			print("person1 : ")
		print()
		if(len(temp2)!=0):
			print("person2 : ",end="")
			for i in range(len(temp2)):
				print(temp2[i],end=" ")
		elif(len(temp2)==0):
			print("person2 : ")
			

T = int(input())
for t in range(T):
	n = int(input())
	l1 = list(map(str,input().split()))
	l2 = list(map(str,input().split()))
	func(l1,l2)
'''



'''
T = int(input())
for t in range(T):
	n = int(input())
	ans = (n**2)-n+1
	print(ans%1000000007)
'''
'''
T = int(input())
for t in range(T):
	n,h = map(int, input().split())
	l = list(map(int, input().split()))
	minn = ceil(float(sum(l))/float(h))
	l1 = l
	count = 0
	h1 = 0
	check1 = 0
	temp = 0
	f = 0
	l.sort()
	r = l[::-1]
#	print(r)
	if(n==h):
		print(r[0])
	elif(h>=sum(r)):
		print(1)
	elif(h<sum(r)):
		
		for i in range(1000):
			index = 0
			h1 = h
			r = l[::-1x]
			while(h1!=0):
				r[index] = r[index]-minn-i
				if(r[index]<=0):
					r.pop(index)
				if(len(r)==0):
					f = 1
					break
				h1 -= 1
#				print(r,h1)
			if(f==1):
				print(minn+i)
				break
'''


'''
N,Q = map(int, input().split())
lt = list(map(int, input().split()))
for q in range(Q):
	a,b,c = map(int, input().split())
	pos = 0
	val = 0
	l = 0
	r = 0
	s = 0
	s1 = 0	l
	l1 = []
	if(a==1):
		pos = b
		val = c
		lt[pos-1] = val
	elif(a==2):
		l = b
		r = c
		if(r-l > 1):
			l1 = lt[l-1:r]
			l1.sort()
			rev = l1[::-1]
			for i in range(len(rev)-2):
				first = rev[i]
				second = rev[i+1]
				third = rev[i+2]
				s1 = first+second+third
				if(first+second>third and second+third>first and first+third>second and s<s1):
					s = s1
					break
		print(s)
'''


'''
#MINVOTE
T = int(input())
for t in range(T):
	n = int(input())
	l = list(map(int, input().split()))
	v = [0] * n
	for i in range(len(l)):
		for j in range(len(l)):
			if(i != j):
				if(i<j):
					new = l[i+1:j]
					s = sum(new)
					if(s<=l[j]):
						v[i] += 1
				elif(i>j):
					new = l[j+1:i]
					s = sum(new)
					if(s<=l[j]):
						v[i] += 1
	print(*v)
'''

'''
maxx = '1111111111111111111111111111111'
n,Q = map(int, input().split())
l = list(map(int, input().split()))
for q in range(Q):
	l,r = map(int, input().split())
	temp = l[l-1:r]
	lt = []
	for i in range(len(temp)):
		boool = bin(temp[i])
		lt.append(boool)
'''


'''
T = int(input())
for t in range(T):
	n,h = map(int, input().split())
	l = list(map(int, input().split()))
	minn = ceil(float(sum(l))/float(h))
	l1 = l
	count = 0
	h1 = 0
	check1 = 0
	temp = 0
	f = 0
	l.sort()
	r = l[::-1]
#	print(r)
	if(n==h):
		print(r[0])
	elif(h>=sum(r)):
		print(1)
	elif(h<sum(r)):
		
		for i in range(1000):
			index = 0
			h1 = h
			r = l[::-1]
			while(h1!=0):
				r[index] = r[index]-minn-i
				if(r[index]<=0):
					r.pop(index)
				if(len(r)==0):
					f = 1
					break
				h1 -= 1
#				print(r,h1)
			if(f==1):
				print(minn+i)
				break
'''



'''
T =  int(input())
for t in range(T):
	n = int(input())
	l = list(map(int, input().split()))
	s = sum(l)
	for i in range(len(l)-1):
		for j in range(i+1,len(l)):
			if((l[i] & l[j]) >= min(l[i],l[j])):
				s += (l[i] & l[j])
	print(s)
'''

'''
#2
T = int(input())
for t in range(T):
	n,c = map(int, input().split())
	l = list(map(int, input().split()))
	count = []
	candy = 0
	for i in range(1,n+1):
		count.append(i)
	for i in range(c):
		if(l[i]==count[i]):
			candy += 1
		elif(l[i]!=count[i] and candy != 0):
			candy -= 1
	diff = n-c
	if(candy>=diff):
		candy -= diff
	if(candy==0 or len(count)>=2*len(l)):
		candy = 1
	print(candy)
'''


'''
#3
T = int(input())
for t in range(T):
	N = int(input())
	break1 = []
	c1 = []
	for n in range(N):
		a,b,c = map(str, input().split())
		b1.append(b)
		c1.append(c)
	check = []
	for i in range(len(c1)):
		for j in range(i+1,len(c1)):
			if(c1[i]==c1[j]):
				check.append(b1[i])
				check.append(b1[j])
	temp = []
	for i in check:
		if(i not in temp):
			temp.append(i)

	if(len(temp)==0):
		print(-1)
	else:
		print(len(temp))	
'''					


'''
#1
T = int(input())
for t in range(T):
	one,two = map(int, input().split())
	l1 = list(map(int, input().split()))
	l2 = list(map(int, input().split()))
	l1odd = 0
	l2odd = 0
	for i in l1:
		if(i%2==1):
			l1odd += 1
	for i in l2:
		if(i%2==1):
			l2odd += 1

	if(l1==l2):
		print("alan")
	elif((one>two and l1odd<l2odd) or (two>one and l2odd<l1odd)):
		print("chef")
	else:
		print("alan")
'''


'''
n,Q = map(int, input().split())
lt = list(map(int, input().split()))
for q in range(Q):
	big = 2147483648
	l,r = map(int, input().split())
	z = lt[l-1:r]
	m = max(z)
	for i in range(l,r):
		x = lt[i]
		bigeven = False
		bigodd = False
		xeven = False
		xodd = False
		if(x%2==1):
			odd = True
		else:
			even = True
'''

'''

'''


'''
N,Q = map(int, input().split())
lt = list(map(int, input().split()))
for q in range(Q):
	a,b,c = map(int, input().split())
	pos = 0
	val = 0
	l = 0
	r = 0
	s = 0
	s1 = 0	
	l1 = []
	if(a==1):
		pos = b
		val = c
		lt[pos-1] = val
	elif(a==2):
		l = b
		r = c
		if(r-l > 1):
			for i in range(l-1,r):
				l1.append(lt[i])
			l1.sort()
			rev = l1[::-1]
			for i in range(len(rev)-2):
				first = rev[i]
				second = rev[i+1]
				third = rev[i+2]
				s1 = first+second+third
				if(first+second>third and second+third>first and first+third>second and s<s1):
					s = s1
					break
		print(s)
'''


'''
from math import *
T = int(input())
for t in range(T):
	n,h = map(int, input().split())
	sortid = list(map(int, input().split()))
	l = sortid
	s = sum(l)
	sortid.sort()
	median = 0
	size = len(l)
	if(len(l)%2==1):
		median = l[size//2]
	else:
		median = (l[size//2]+l[(size//2)-1])/2
	m = max(median,h)
	print(ceil(s/m))
'''	


'''
T = int(input())
for t in range(T):
	n = int(input())
	l = list(map(int, input().split()))
	temp = []
	for i in l:
		if(i not in temp):
			temp.append(i)
	if(len(l)==len(temp)):
		print(0)
	else:
		print(len(l)-len(temp))
'''			


'''
T = int(input())
for t in range(T):
	N = int(input())
	lss = []
	for n in range(N):
		price, quantity, discount = map(int, input().split())
		newprice = price*(discount/100)
		sp = newprice*((100-discount)/100)
		loss1 = newprice - sp
		loss = loss1 * quantity
		lss.append(loss)
	print(sum(lss))
'''


'''
T = int(input())
for t in range(T):
	n = int(input())
	finger = list(map(int, input().split()))
	front = list(map(int, input().split()))
	back = front[::-1]
	f = 0
	b = 0
	for i in range(len(finger)):
		if(finger[i]<=front[i]):
			f = 1
		else:
			f = 0
			break

	for i in range(len(finger)):
		if(finger[i]<=back[i]):
			b = 1
		else:
			b = 0
			break

	if(f==1 and b==1):
		print("both")
	elif(f==1 and b!=1):
		print("front")
	elif(f!=1 and b==1):
		print("back")
	else:
		print("none")
'''

'''
n = int(input())
l = list(map(int,input().split()))
left = 0
right = len(l)-1
while(left<=right):
	if(len(l)%2==0):
		print(l[left])
		print(l[right])
	else:
		if(left==right):
			print(l[left])
		else:
			print(l[left])
			print(l[right])
	left += 1
	right -= 1
'''

'''
T = int(input())
for t in range(T):
	s = input()
	cf = 0
	co = 0
	cb = 0
	ca = 0
	cr = 0
	for i in s:
		if(i=='f'):
			cf += 1
		elif(i=='o'):
			co += 1
		elif(i=='b'):
			cb += 1
		elif(i=='a'):
			ca += 1
		elif(i=='r'):
			cr += 1
	co = co//2
	a = []
	a.append(cf)
	a.append(co)
	a.append(cb)
	a.append(ca)
	a.append(cr)
	print(min(a))
'''


'''
def merge(arr, l, m, r):
	n1 = m - l + 1
	n2 = r- m
 
	L = []
	R = []
	n1 = int(n1)
	n2 = int(n2)
	l = int(l)
	m = int(m)
	r = int(r)
	for i in range(n1):
		L.append(0)

	for i in range(n2):
		R.append(9)
 
	for i in range(0 , n1):
		L[i] = arr[l + i]
 
	for j in range(0 , n2):
		R[j] = arr[m + 1 + j]
 
	i = 0     
	j = 0     
	k = l     
 
	while i < n1 and j < n2 :
		if L[i] <= R[j]:
			arr[k] = L[i]
			i += 1
		else:
			arr[k] = R[j]
			j += 1
		k += 1
 
	while(i < n1):
		arr[k] = L[i]
		i += 1
		k += 1

	while(j < n2):
		arr[k] = R[j]
		j += 1
		k += 1

def mergeSort(arr,l,r):
	if l < r:
		m = (l+(r-1))/2
		mergeSort(arr, l, m)
		mergeSort(arr, m+1, r)
		merge(arr, l, m, r)
				
T = int(input())
for t in range(T):
	n = int(input())
	l = list(map(int, input().split()))
	arr = l
	l1 = len(arr)
	mergeSort(arr,0,l1-1)
	median = 0
	if(len(l)%2==0):
		median = arr[(l1//2)-1]
	else:
		median = arr[l1//2]
	print(median)
'''


'''
def MergeSort(array, low, high):
	if(low == high):
		b = []
		b.append(array[low])
		return b
	else:
		mid = (low+high)/2;
		one = MergeSort(array,low,mid)
		two = MergeSort(array,mid+1,high)
		return Merge(one,two)

def Merge(one, two):
	i = 0
	j = 0
	sortid = []
	while(i<len(one) and j<len(two)):
		if(one[i]<two[j]):
			sortid.append(one[i])
			i += 1
		else:
			sortid.append(two[j])
			j += 1

	while(i<len(one)):
		sortid.append(one[i])
		i += 1

	while(j<len(two)):
		sortid.append(two[j])
		j += 1

	return sortid

a = [34,63]
print(MergeSort(a,0,len(a)-1))
'''

'''
def S_Sort(l):
	for i in range(len(l)-1):
		min1 = i
		for j in range(i+1,len(l)):
			if(l[j]<l[min1]):
				min1 = j
		temp = l[min1]
		l[min1] = l[i]
		l[i] = temp
	return l

T = int(input())
for t in range(T):
	n,m = map(int, input().split())
	l = []
	s = 0
	for i in range(n):
		l += list(map(int, input().split()))
	sortid = S_Sort(l)
	array = sortid[::-1]
	s1 = 0
	s2 = 0
	for i in range(len(array)):
		if(i%2==0):
			s1 += array[i]
		else:
			s2 += array[i]
	if(s1>s2):
		print("Cyborg")
	elif(s1<s2):
		print("Geno")
	else:
		print("Draw")
'''


'''
def S_Sort(l):
	for i in range(len(l)-1):
		min1 = i
		for j in range(i+1,len(l)):
			if(l[j]<l[min1]):
				min1 = j
		temp = l[min1]
		l[min1] = l[i]
		l[i] = temp
	return l

T = int(input())
L = []
X = []
Y = []
for t in range(T):
	x,y = map(int, input().split())
	X.append(x)
	Y.append(y)
	for i in range(len(X)):
		for j in range(len(Y)):
			a = (X[i]-X[j])**2
			b = (Y[i]-Y[j])**2
			d = float((a+b)**(1/2))
			L.append(d)
ans = S_Sort(L)
print("%.2f" % ans[-1])
'''

'''
def func(divisor,l):	
	f = 0
	for i in l:
		if(i==0):
			return True
		elif((i/divisor)%2==0):
			return True
	return False

T = int(input())
divisor = int(input())
for t in range(T):
	n = int(input())
	l = list(map(int, input().split()))
	print(func(divisor,l))
'''





'''
t=int(input())
for k in range(t):
	ip=[int(j) for j in input().split()]
	p=1
	#print(ip)
	n=ip[0]
	u=ip[1]
	d=ip[2]
	h=[int(m) for m in input().split()]
 
	ans=0
	for i in range(n-1):
		#print(h[i],h[i+1])
		if ans==i:
			if(h[i]<h[i+1] and (h[i+1]-h[i])<=u):
				ans=i+1
			elif(h[i]>h[i+1] and (h[i]-h[i+1])<=d):
				ans=i+1
			elif(h[i]==h[i+1]):
				ans=i+1
			elif(h[i]>h[i+1] and p==1):
				ans=i+1
				p-=1
		else:
			break
	print(ans+1)
'''

'''
T = int(input())
for t in range(T):
	n,u,d = map(int, input().split())
	l = list(map(int, input().split()))
	pos = 1
	f = 0
	for i in range(len(l)-1):
		if(l[i]==l[i+1]):
			pos += 1
#			print("@")
		elif(l[i]<l[i+1] and l[i+1]-l[i]<=u):
			pos += 1
#			print("$")
		elif(l[i]>l[i+1] and l[i]-l[i+1]<=d):
#			print(l[i],l[i+1],i)
			pos += 1
#			print("!")
		elif(f==0 and l[i]>l[i+1]):
#			print("*")
			pos += 1
			f = 1 
		else:
			break
	print(pos)
'''

'''
l = ['chef','chfe','cfhe','cfeh','cehf','cefh','echf','ecfh','efch','efhc','ehfc','ehcf','fceh','fche','fhce','fhec','fech','fehc','hefc','hecf','hfce','hfec','hcfe','hcef']
T = int(input())
for t in range(T):
	s = input()
	c = 0
	f = 0
	for i in range(0,len(s)-3):
		s1 = s[i:i+4]
		if(s1 in l):
			c += 1
			f = 1
	if(f==1):
		print("lovely",c)
	else:
		print("normal")
'''
'''
n = int(input())
f = 1
flag = 0
for i in range(1,n+1):
	f*= i
c = 0
if(n==0 or f==1 or f==2):
	f = 1
	print(-1)
while(f%10==0):
#	print("$$")
	c+= 1
	f = f/10
if(flag!=1):
	print(c)
'''
'''
T = int(input())
for t in range(T):
	n,m = map(int, input().split())
	f = 0
	l = []
	if(m==0):
		print("No 1")
		f = 1
	if(f!=1):
		for i in range(1,n+1):
			l.append(i)
		lc = []
		lc = l[:m]
		for i in range(m):
			l.pop(0)
		l += lc
		print(l)
		i = 0
		c = 0
		f1 = 0
		f2 = 0
		while(l[i]!=0 or c!=n):
			x = l[i]
			l[i] = 0
			i = x-1
			if(l[i]==0):
				f1 = 1
			c += 1
			if(c==n):
				f2 = 1
		if(f1!=1 and f2!=1):
			print("Yes")
		else:
			ans = 0
			for i in l:
				if(i==0):
					c += 1
			print("No",c)
'''
'''
from math import *

T = int(input())
for t in range(T):
	choc_in_box,choc_daily,days_to_s = map(int, input().split())
	f = 0
	if(choc_daily!=0):
		x = choc_in_box//choc_daily
	else:
		f = 1      
	y = choc_in_box%choc_daily
	ans = 0
	if(f==1):
		print("*")
		print(0)
	elif(choc_in_box<choc_daily):
		print(-1)
	elif(choc_in_box==choc_daily and days_to_s>6):
		print(-1)
	elif(((choc_in_box-choc_daily)*6)<choc_daily and choc_in_box!=choc_daily and days_to_s>6):
		print(-1)
	else:
		print(ceil(days_to_s/x))
'''

'''
T = int(input())
for t in range(T):
	N = int(input())
	L = []
	for n in range(N):
		l = list(map(int, input().split()))
		L.append(l)
	d1 = -1
	d2 = -1
	d3 = -1
	l1 = []
	l2 = []
	l3 = []
	L1 = []
	L2 = []
	L3 = []
	for i in range(len(L)):
		if(L[i][1]==1):
			if(L[i][2]>d1):
				d1 = L[i][2]
				if(len(l1)==1):
					l1.pop()
					l1.append(L[i][0])
				else:
					l1.append(L[i][0])
			elif(L[i][2]==d1):
				if(l1[-1]>L[i][0]):
					l1.pop()
					l1.append(L[i][0])
	for i in range(len(L)):
		if(L[i][1]==2):
			if(L[i][2]>d2):
				d2 = L[i][2]
				if(len(l2)==1):
					l2.pop()
					l2.append(L[i][0])
				else:
					l2.append(L[i][0])
			elif(L[i][2]==d2):
				if(l2[-1]>L[i][0]):
					l2.pop()
					l2.append(L[i][0])
	for i in range(len(L)):
		if(L[i][1]==3):
			if(L[i][2]>d3):
				d3 = L[i][2]
				if(len(l3)==1):
					l3.pop()
					l3.append(L[i][0])
				else:
					l3.append(L[i][0])
			elif(L[i][2]==d3):
				if(l3[-1]>L[i][0]):
					l3.pop()
					l3.append(L[i][0])
	print(d1,l1[-1])
	print(d2,l2[-1])
	print(d3,l3[-1])
'''


'''
T = int(input())
for t in range(T):
	N = int(input())
	s = 0
	for n in range(N):
		 l = list(map(int, input().split()))
		 l.sort()
		 s += l[-1]-l[0]
	print(s)
'''


'''
import math
T=int(input())
 
for i in range(T):	#ME
	A=	list(map(int, input().split()))
	t=math.sqrt((2*A[0])/10)
	for j in range(A[1]):
		a=int(input())
 
		if(a%t==0 and ((a//t)%2)==0):
			print('Top')
		elif(a%t==0 and ((a//t)%2)!=0):
			print('Bottom')
		elif(((a//t)%2)==0):
			print('Down')
		else:
			print('Up')
'''

'''
import collections
def sub_lists(my_list):
	subs = [[]]
	for i in range(len(my_list)):
		n = i+1
		while n <= len(my_list):
			sub = my_list[i:n]
			subs.append(sub)
			n += 1
	
	return subs

n = int(input())
l = list(map(int, input().split()))
L = sub_lists(l)
max1 = -999999999999
for i in L:
	if(len([item for item, count in collections.Counter(i).items() if count > 1]) > 0):
		continue
	else:
		if(sum(i)>max1):
			max1 = sum(i)
print(max1)
'''

'''
def get_all_substrings(input_string):
  length = len(input_string)
  return [input_string[i:j+1] for i in range(length) for j in range(i,length)]

T = int(input())
for t in range(T):
	s = input()
	l = get_all_substrings(s)
	L = []
	for i in l:
		n = int(i)
		if(n%9==0):
			L.append(n)
		
	print(len(L))
'''

'''
import sys
Q= int(input())
for q in range(Q):
	n,k = map(int, sys.stdin.readline().split(' '))
	s = 0
	days = 0
	i = 1
	if(k==1):
		while(s<n):
			s += i
			days += 1
			i += 1
			if(s+i > n):
				break

	if(k==2):
		while(s<n):
			s += i**2
			days += 1
			i += 1
			if(s+(i**2) > n):
				break

	if(k==3):
		while(s<n):
			s += i**3
			days += 1
			i += 1
			if(s+(i**3) > n):
				break

	print(days)
'''



