Problem:
 Score : 100 points    Problem Statement AtCoDeer has three cards, one red, one green and one blue. An integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card. We will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer. Is this integer a multiple of 4 ?      Constraints  1 ≤ r, g, b ≤ 9         Input Input is given from Standard Input in the following format:  r  g  b       Output If the three-digit integer is a multiple of 4 , print YES (case-sensitive); otherwise, print NO .        Sample Input 1 4 3 2      Sample Output 1 YES  432 is a multiple of 4 , and thus YES should be printed.       Sample Input 2 2 3 4      Sample Output 2 NO  234 is not a multiple of 4 , and thus NO should be printed.

Solution (Python):
r,g,b = map(int,input().split())

number = [g,b]
print('YES') if int(''.join(map(str,number))) % 4 == 0 else print('NO')

Solution (Python):
A,B,C = list(map(str,input().split()))
ABC = int(A+B+C)
ans ="NO"
if ABC % 4 == 0:
  ans = "YES"
print(ans)

Solution (Python):
import sys

r,g,b = map(str, sys.stdin.readline().split())

sum = int(r + g + b)

if sum % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = list(input().split())
x = int(r+g+b)
 
if x % 4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
if int("".join(map(str, input().split()))) % 4 == 0 :
  print("YES")
else :
  print("NO")

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf')
ans = 0 ;count = 0 ;pro = 1

r,g,b=input().split()
a=r+g+b
if int(a)%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
str_list = list(input().split())
if int(''.join(str_list)) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = list(input().split())
ans = 'YES' if int(r + g + b) % 4 == 0 else 'NO'
print(ans)

Solution (Python):
a, b, c = input().split()
print('YES') if int(a + b + c) % 4 == 0 else print('NO')

Solution (Python):
r,g,b=input().split()
num=r+g+b
print("YES" if eval(num)%4==0 else "NO")

Solution (Python):
l = [i for i in input().split()]

num = int(''.join(l))

print('YES' if num % 4 == 0 else 'NO')

Solution (Python):
r,g,b=map(int,input().split())
print("NO" if (g*10+b)%4 else "YES")

Solution (Python):
r, g, b = map( int, input().split() )
n = r * 100 + g * 10 + b
print( [ "NO", "YES" ][ n % 4 == 0 ] )

Solution (Python):
r, g, b = input().split()
ans = int(r + g + b)
if ans % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
a,b,c=map(int,input().split())

if (100*a+10*b+c)%4==0:
  print("YES")
else:
  print("NO")

Solution (Python):
print("YES" if int(input()[::2])%4==0 else "NO")

Solution (Python):
r, g, b = list(map(int, input().split()))
print('YES' if (g*10+b)%4==0 else 'NO')

Solution (Python):
r, g, b = map(int, input().split())
if (g * 10 + b) % 4 == 0:
  print('YES')
else:
  print('NO')

Solution (Python):
r,g,b = map(int,input().split())
if (g * 10 + b) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
rgb = input().replace(' ','')

if int(rgb)%4==0:
    print('YES')
else:
    print('NO')

Solution (Python):
r, a, b = input().split()
num = int(r+a+b)
if num%4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
R,G,B=input().split(" ")
r=int(R)
g=int(G)
b=int(B)
s=100*r+10*g+b
if s%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = input().split()
if int(r + g + b) % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
r,g,b=map(int,input().split())
if (10*g+b)%4==0:
  print('YES')
else:
  print('NO')

Solution (Python):
r,g,b = map(str, input().split())
print('YES' if int(r+g+b)%4==0 else 'NO')

Solution (Python):
rgb = input().replace(' ', '')
print("YES" if int(rgb) % 4 == 0 else "NO")

Solution (Python):
r, g, b = map(int, input().split())
if (r * 100 + g * 10 + b) % 4 == 0:
  print('YES')
else:
  print('NO')

Solution (Python):
r,g,b=map(int,input().split())
ans=r*100+g*10+b
if(ans%4==0):
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b=map(int,input().split())
if (10*g+b)%4==0:
  print('YES')
else:
  print('NO')

Solution (Python):
print("YES" if eval(input().replace(" ",""))%4==0 else "NO")

Solution (Python):
r, g, b = list(map(int, input().split()))

rgb = int(str(r) + str(g) + str(b))

if rgb%4 == 0:
	print('YES')
else:
	print('NO')

Solution (Python):
def is_multiple_of_four(r, g, b):
  l2d = int(g)*10+int(b) 
  print("YES") if l2d%4 == 0 else print("NO")

r, g, b = input().split(" ")
is_multiple_of_four(r, g, b)

Solution (Python):
r, g, b = input().split()

n = int(r + g + b)

print("YES" if n % 4 == 0 else "NO")

Solution (Python):
r,g,b = map(int,input().split())
print("YES" if (100*r+10*g+b)%4==0 else("NO"))

Solution (Python):
a,g,b=map(int,input().split())

if (g*10+b)%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
a,b,c = map(int,input().split())
if (100*a+10*b+c) % 4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
l = list(map(int, input().split()))
rgb = l[0] * 100 + l[1] * 10 + l[2]
if rgb % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b=(int(x) for x in input().split())

t=r*100+g*10+b
if t%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
a, b, c = map(int, input().split())
d = a * 100 + b * 10 + c
if (d % 4 == 0):
    print('YES')
else:
    print('NO')

Solution (Python):
print("YES" if not eval(input().replace(" ", "")) % 4 else "NO")

Solution (Python):


yes = "YES"
no = "NO"
if __name__ == "__main__":
    r, g, b = map(int, input().split(' '))
    answer = ""
    checkNo = (g*10+b) % 4
    if checkNo == 0:
        answer = yes
    else:
        answer = no
    print(answer)
exit

Solution (Python):
from sys import stdin

A, B, C = [int(x) for x in stdin.readline().rstrip().split()]

total = str(A) + str(B) + str(C)
if int(total) % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
r,g,b=map(str,input().split())
ans='YES' if int(r+g+b)%4 == 0 else 'NO'
print(ans)

Solution (Python):
r, g, b = map(int, input().split(" "))

if (10 * g + b) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b = map(int,input().split())
if (r*100+g*10+b)%4==0:
    print('YES')
else:
    print('NO')

Solution (Python):


yes = "YES"
no = "NO"
if __name__ == "__main__":
    r, g, b = map(int, input().split(' '))
    answer = ""
    checkNo = (g*10+b) % 4
    if checkNo == 0:
        answer = yes
    else:
        answer = no
    print(answer)
exit

Solution (Python):
r,g,b = map(int, input().split())
if (2*g + b)%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = input().split(" ")
num = int(r + g + b)
if num % 4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
r,g,b = map(int,input().split())

c=100*r+10*g+b

if c%4==0:
  print("YES")
else:
  print("NO")

Solution (Python):
n=int(input().replace(' ', ''))
if n%4==0:
  print("YES")
else:
  print("NO")

Solution (Python):
r,g,b=list(map(int,input().split(" ")))
if ((100*r+10*g+b)%4==0):
  print('YES')
else:
  print('NO')

Solution (Python):
r, g, b = map(int, input().split())
if (100*r + 10*g + b) % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
array = input().split()
score = int(array[1]) * 10 + int(array[2])
if score % 4 == 0:
   print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = input().split()

if int(r + g + b) % 4 == 0:
    ans = "YES"
else:
    ans = "NO"

print(ans)

Solution (Python):
s = input().split()
js = ''.join(s)

if int(js)%4==0:
  print('YES')
else:
  print('NO')

Solution (Python):


rgbs = list(map(int,input().split(' ')))
g = rgbs[1]
b = rgbs[2]
answer =''
checkgb=((g*10+b)%4)
if checkgb == 0:
    answer = "YES"
else:
    answer = "NO"
print(answer)

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

n = int(input()[:-1].replace(' ', ''))
print('YNEOS'[n % 4 != 0::2])

Solution (Python):
a = list(input().split())
print('YES') if int("".join(a))%4 == 0 else print('NO')

Solution (Python):
r, g, b = map(str, input().split())
t = int(r+g+b)
if t%4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):


rgb=int("".join(input().split(" ")))

if rgb%4==0: 
    print("YES")
else: 
    print("NO")

Solution (Python):
s = input()
if int(s[::2])%4==0:
  print("YES")
else:
  print("NO")

Solution (Python):
r,g,b = map(int,input().split())
jud = 10*g + b
if jud%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b = map(int, input().split())

if (g*10 + b) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b = map(int, input().split())
num = 100*r+10*g+b
print('YES' if num % 4 == 0 else 'NO')

Solution (Python):
s=input()
print("YES" if int((s[::2]))%4==0 else "NO")

Solution (Python):
print("YNEOS"[int(input().replace(" ",""))%4!=0::2])

Solution (Python):
from sys import stdin

a,b,c = [int(x) for x in stdin.readline().rstrip().split()]

if int(str(a)+str(b)+str(c))%4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = input().split()
number = r + g + b
if int(number) % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
r,g,b = input().split()
num = int(r+g+b)
if num % 4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
r,g,b = map(int,input().split())
if (r*100+g*10+b)%4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = list(map(int, input().split()))

if 1 <= r <= 9 and 1 <= g <= 9 and 1 <= b <= 9:
    res = "YES" if (r * 100 + 10 * g + b) % 4 == 0 else "NO"
    print(res)
else:
    print("error")

Solution (Python):
a,b,c=map(int,input().split())
n=100*a+10*b+c
if(n%4==0):
  print("YES")
else:
  print("NO")

Solution (Python):
r,g,b = list(map(int,input().split()))
A=r*100+g*10+b

if A%4==0:
  print("YES")
else:
  print("NO")

Solution (Python):
r,g,b = map(str, input().split())

gtasub = (g+b)
gtasub_int =int(gtasub)

if (gtasub_int % 4) == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(''.join(input().split()))
if n % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
r,g,b=map(int, input().split())
x=100*r+10*g+b
if x%4==0:
 print('YES')
else:
  print('NO')

Solution (Python):
a = ""
b = list(map(int, input().split()))
for i in range(3):
  a += str(b[i])
if int(a)%4:
  print("NO")
else:
  print("YES")

Solution (Python):
r, g, b = map(int, input().split())
x = r*100+g*10+b
if x % 4 ==0:
  print("YES")
else:
  print("NO")

Solution (Python):
x = input().split()
xx = int("".join(x))
if xx % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):

import math


r, g, b = map(int, input().split())

if (100*r + 10*g + b) % 4 == 0 :
  print ("YES")
else :
  print ("NO")

Solution (Python):
r, g, b = map(str,input().split())
num = int(r+g+b)
if num % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
r, g, b = map(int, input().split())

if (r*100+g*10+b)%4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
a,b,c = map(int,input().split())
if (b*10+c)%4:
    print('NO')
else:
    print('YES')

Solution (Python):
l = input().split(' ')
r = int(l[0])
g = int(l[1])
b = int(l[2])
a = 100*r + 10*g + b
mod = a % 4
if mod == 0 :
    print('YES')
else:
    print('NO')

Solution (Python):
r, g, b = map(int, input().split())
if (100 * r + 10 * g + b) % 4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
_,g,b=input().split();print("YNEOS"[int(g+b)%4!=0::2])

Solution (Python):
r, g, b = map(int, input().split())

if (10 * g + b) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = input().split()
if int(r+g+b) % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
r,g,b = map(int,input().split())

if (int(g)*10+int(b))%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b=map(int,input().split())

x = 10*g + b

if x % 4 == 0:
  print("YES") 
else:
  print("NO")

Solution (Python):
a,b,c=map(int,input().split())
if (a*100+b*10+c)%4==0:
  print("YES")
else:
  print("NO")

Solution (Python):
r, g, b = map(int, input().split())
m = 10*g + b
if m % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):

si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
r,g,b = map(str, input().split())
s = r+g+b
if int(s)%4==0:
    print('YES')
else:
    print('NO')

Solution (Python):

a, b, c = map(int, input().split())
num = a*100 + b*10 + c
if num % 4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
r, g, b = map(int, input().split())
a = r*100+g*10+b
print('YES' if a%4==0 else 'NO')

Solution (Python):
a = input()

b,c,d = map(int, a.split())

if (b*100 + c*10 + d) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = map(str, input().split())
x = int(r + g + b)
if x % 4 == 0:
       print('YES')
else:  print('NO')

Solution (Python):
r,g,b = map(int,input().split())
N = g * 10 + b

if N%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b=map(int,input().split())
X = r * 100 + g * 10 + b
if X % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
def examA():
    r, g, b = LI()
    if (g*10+b)%4==0:
        ans = "YES"
    else:
        ans = "NO"
    print(ans)



import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Solution (Python):
r, g, b = map(int, input().split())
num = r * 100 + g * 10 + b
if not(num % 4) :
    print("YES")
else:
    print("NO")

Solution (Python):
print('YES' if eval(input().replace(' ','')+'%4')==0 else 'NO')

Solution (Python):
r,g,b=map(str, input().split()) 
ans = int(r+g+b)
if ans%4==0:
    print('YES')
else:
    print('NO')

Solution (Python):
r,g,b=map(int,input().split())
if (r*100+g*10+b)%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    r,g,b = LI()
    ans = ["YES","NO"]
    print(ans[((((((g<<1)&b)<<1)+((g<<1)^b))&((1<<1)|1))>>int(math.log(max(1,(((((g<<1)&b)<<1)+((g<<1)^b))&((1<<1)|1))&(-(((((g<<1)&b)<<1)+((g<<1)^b))&((1<<1)|1)))),(1<<1))))&1])
    return


if __name__ == "__main__":
    solve()

Solution (Python):
print(["YES","NO"][int("".join(input().split()))%4!=0])

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    r,g,b = LI()
    ans = ["YES","NO"]
    print(ans[((((((g<<1)&b)<<1)+((g<<1)^b))&3)>>int(math.log(max(1,(((((g<<1)&b)<<1)+((g<<1)^b))&3)&(-(((((g<<1)&b)<<1)+((g<<1)^b))&3))),2)))&1])
    return


if __name__ == "__main__":
    solve()

Solution (Python):
r,g,b=map(int,input().split())
if (r*100+g*10+b)%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    n, m, R = LI()
    r = LI_()
    edg = [[inf] * n for i in range(n)]
    for _ in range(m):
        a, b, c = LI_()
        c += 1
        edg[a][b] = c
        edg[b][a] = c
    for i in range(n):
        edg[i][i] = 0
    for k in range(n):
        for i in range(n):
            for j in range(n):
                edg[i][j] = min(edg[i][j], edg[i][k] + edg[k][j])
    fulls = itertools.permutations(range(R), R)
    ans = inf
    for full in fulls:
        b = -1
        tmp = 0
        for f in full:
            if b == -1:
                b = r[f]
                continue
            tmp += edg[r[f]][b]
            b = r[f]
        ans = min(ans, tmp)
    print(ans)

    return


def B():
    n, m = LI()
    time = [[inf] * n for i in range(n)]
    for _ in range(m):
        a, b, t = LI_()
        t += 1
        time[a][b] = t
        time[b][a] = t
    for i in range(n):
        time[i][i] = 0
    for k in range(n):
        for i in range(n):
            for j in range(n):
                time[i][j] = min(time[i][j], time[i][k] + time[k][j])
    for k in range(n):
        for i in range(n):
            if time[i][k] == inf:
                time[i][k] = 0
    ans = inf
    for i in range(n):
        ans = min(ans, max(time[i]))
    print(ans)
    return


def C():
    h, w, t = LI()
    s = SR(h)
    for i in range(h):
        for k in range(w):
            if s[i][k] == "S":
                start = (i, k)
            if s[i][k] == "G":
                goal = (i, k)

    def f(X):
        dist = [[inf] * w for i in range(h)]
        dist[start[0]][start[1]] = 0
        q = [[0, start]]
        while q:
            
            time, a = heappop(q)
            y, x = a
            for yi, xi in [[0, -1], [0, 1], [1, 0], [-1, 0]]:
                yi += y
                xi += x
                
                if 0 <= yi < h and 0 <= xi < w:
                    if s[yi][xi] == "
                        if dist[yi][xi] > time + X:
                            heappush(q, [time + X, [yi, xi]])
                            dist[yi][xi] = time + X
                    else:
                        if dist[yi][xi] > time + 1:
                            heappush(q, [time + 1, [yi, xi]])
                            dist[yi][xi] = time + 1
        
        return dist[goal[0]][goal[1]]

    ok = 1
    ng = t + 1
    
    while abs(ok - ng) > 1:
        mid = (ng + ok) // 2
        if f(mid) <= t:
            ok = mid
        else:
            ng = mid
        
    print(ok)
    return


def D():
    n = II()
    a, b = LI_()
    m = II()
    xy = [[] for i in range(n)]
    for _ in range(m):
        x, y = LI_()
        xy[x].append(y)
        xy[y].append(x)
    d = [inf] * n
    d[a] = 0
    q = [[0, a]]
    while q:
        dist, now = heappop(q)
        for i in xy[now]:
            if d[i] > dist + 1:
                heappush(q, (dist + 1, i))
                d[i] = dist + 1
    ans = 1
    q = [b]
    while q:
        qi = q[::1]
        q = []
        tmp = 0
        while qi:
            x = qi.pop()
            score = d[x]
            for xi in xy[x]:
                if d[xi] + 1 == score and not xi in q:
                    q.append(xi)
                    
                    tmp += 1
        
        ans *= tmp  
        ans %= mod
        q = list(set(q))
        
        if q[0] == a:
            break
    print(ans)
    return


def E():
    x = S()
    f = True
    while f and x:
        f = False
        if len(x) >= 2:
            if x[-1] == "h" and x[-2] == "c":
                x = x[:-2]
                f = True
                continue
        if x[-1] == "o":
            x = x[:-1]
            f = True
        elif x[-1] == "k":
            x = x[:-1]
            f = True
        elif x[-1] == "u":
            x = x[:-1]
            f = True
        
    if f:
        print("YES")
    else:
        print("NO")
    return


def F():
    s = S()
    n = II()
    for i in range(n):
        l, r = LI_()
        s[l: r + 1] = s[l: r + 1][::-1]
    print("".join(s))
    return


def G():
    s = S()
    ans = []
    i = 0
    while i  < len(s):
        ans.append(s[i])
        tmp = 0
        x = s[i]
        while i != len(s):
            if x == s[i]:
                tmp += 1
                i += 1
                continue
            break
        ans.append(str(tmp))
    print("".join(ans))
    return


def H():
    r, g, b = LI()
    if g & 1 and b % 4 == 2:
        print("YES")
        return
    if not (g & 1) and b % 4 == 0:
        print("YES")
        return
    print("NO")
    return


if __name__ == '__main__':
    H()

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    r,g,b = LI()
    ans = ["YES","NO"]
    print(ans[((((g<<1)&b)<<1)+((g<<1)^b))&3>0])
    return


if __name__ == "__main__":
    solve()

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    r,g,b = LI()
    ans = ["YES","NO"]
    print(ans[((g<<1)+b)&3>0])
    return


if __name__ == "__main__":
    solve()

Solution (Python):
r,g,b=map(int,input().split())
if (r*100+g*10+b)%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

r,g,b = LI()
s = str(r)+str(g)+str(b)
if int(s) % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    r,g,b = LI()
    s = r*100+g*10+b
    if s%4 == 0:
        print("YES")
    else:
        print("NO")
    return


if __name__ == "__main__":
    solve()

Solution (Python):
r, g, b = [int(x) for x in input().split()]
if (r*100 + g*10 + b) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
def main():
  r, g, b = map(lambda i: int(i), input().split(' '))
  n = 100 * r + 10 * g + b
  print('YES' if n % 4 == 0 else 'NO')

main()

Solution (Python):
x, a, b = map(int, input().split())

num = str(x) + str(a) + str(b)
num = int(num)
if num % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
print("NO" if int(input()[::2]) % 4 else "YES")

Solution (Python):
r, g, b = map(str, input().split())

v = int(r + g + b)

if v % 4 == 0:
  print('YES')
else:
  print('NO')

Solution (Python):
from sys import stdin
r,g,b = [int(x) for x in stdin.readline().rstrip().split()]
a = 100*r+10*g+b
if a%4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b = map(int, input().split())

decimal = r*100 + g*10 + b

if decimal % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
r,g,b=map(int,input().split())
print('YES' if (r*100+g*10+b)%4 == 0 else 'NO')

Solution (Python):
a,b,c = map(int,input().split())

if (a*100+b*10+c)%4 == 0:
	ans = 'YES'
else:
	ans = 'NO'
	
print(ans)

Solution (Python):
r,g,b=map(int,input().split())
if (r*100+g*10+b)%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):

r, g, b = map(int, input().split())
if (10*g + b)%4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b = map(int, input().split())
if (100*r+10*g+b) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b=map(str,input().split())
ans=int(r+g+b)
print('YES' if ans%4==0 else 'NO')

Solution (Python):
r,g,b = map(int,input().split())
val = 100*r + 10*g + b

if val % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b = map(int,input().split())
val = 100*r + 10*g + b

if val % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
import sys
input = sys.stdin.readline
r, g, b = map(int, input().split())
if (g * 10 + b) % 4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
a, b, c = map(int, input().split())
print("NO" if (b*10+c)%4 else "YES")

Solution (Python):
li = list(map(int, input().split()))

if (li[0]*100 + li[1]*10 + li[2]) % 4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
r,g,b = input().split()
if int(r+g+b)%4==0: print('YES')
else: print('NO')

Solution (Python):
a,b,c=map(int,input().split())
if (b*10+c)%4==0:
  print('YES')
else:
  print('NO')

Solution (Python):
import sys
input = sys.stdin.readline

rgb = int(''.join(input().split()))

if rgb % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
a, b, c = map(int, input().split())
num = b * 10 + c
if num % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):

r, g, b = [s for s in input().split()]
number = int(r + g + b)
print('YES' if number % 4 == 0 else 'NO')

Solution (Python):

r, g, b = input().split()
num = int(r+g+b)
if(num % 4 == 0):
  print('YES')
else:
  print('NO')

Solution (Python):
r, g, b = map(int, input().split())
if (100*r + 10*g + b)%4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
r,g,b = map(int, input().split())
if (r*100+g*10+b)%4==0:
  print('YES')
else:
  print('NO')

Solution (Python):
r, g, b = map(int, input().split())

if (100 * r + 10 * g + b) % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
r,g,b =map(int, input().split())
if(100*r + 10*g +b)%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b=input().split()
print('YES') if int(r+g+b)%4==0 else print('NO')

Solution (Python):
r,g,b = map(int,input().split())
if (g * 10 + b) % 4 == 0:
  print('YES')
else:print('NO')

Solution (Python):
if int("".join(list(input().split()))) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
x = input().split()
num = x[0] + x[1] + x[2]
if int(num) % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
a = int(input().replace(" ",""))

if a % 4 == 0:
    print("YES")
    
else:
    print("NO")

Solution (Python):
x = input().split()
print('YES' if int("".join(x)) % 4 == 0 else'NO')

Solution (Python):
r,g,b = (int(x) for x in input().split())

num = 100*r + 10*g + b

if num%4 == 0:
  print('YES')
else:
  print('NO')

Solution (Python):
r, g, b = map(int, input().split())

if (r * 100 + g *10 + b) % 4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
r,g,b = map(int,input().split())
if (100*r+10*g+b) % 4 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
print('NO' if int(input().replace(' ',''))%4 else 'YES')

Solution (Python):
r,g,b=map(int,input().split())
if (100*r+10*g+b)%4==0:
  print('YES')
else:
  print('NO')

Solution (Python):
r,g,b = map(int,input().split())
a = r*100+g*10+b

if a%4 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
r, g, b = map(str, input().split())
if int(r+g+b)%4==0:
  print("YES")
else:
  print("NO")

Solution (Python):
r,g,b=map(int,input().split())
print('YES' if (10*g+b)%4==0 else 'NO')

Solution (Python):
r,g,b = map(int, input().split())

print('YES' if (r *100 + g *10 + b) % 4 == 0 else 'NO')

Solution (Python):




r,g,b = input().split()

a = r+g+b
a = int(a)


if a%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
r, g, b = map(int, input().split())

if (g * 10 + b) % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
k = "".join(list((input().split())))
k = int(k)
if k % 4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
r,g,b = map(int,input().split())
if (r*100+g*10+b)%4 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
x = list(map(str,input().split()))
if int(x[1]+x[2])%4==0:
  print("YES")
else:
  print("NO")

Solution (Python):
"""
author : halo2halo
date : 24,Oct,2019
"""

import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

a, b, c = map(int, readline().rstrip().split())

print("YES" if (a*100+b*10+c) % 4 == 0 else "NO")

Solution (Python):
r,g,b=map(int,input().split())
result = (r*100+g*10+b)%4
if result==0:
  print('YES')
else:
  print('NO')

Solution (Python):
a,b,c=map(int,input().split())
c=(int(str(a)+str(b)+str(c)))
if c%4==0:
    print("YES")
else:
    print("NO")

Solution (Python):
a = list(input().split())
n = int("".join(map(str, a)))
print("YES" if n % 4 == 0 else "NO")