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.



Sample input:
4 3 2


Sample output:
YES

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
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

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
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

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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')

#A
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

#B
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

#C
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:
            # print(q,1)
            time, a = heappop(q)
            y, x = a
            for yi, xi in [[0, -1], [0, 1], [1, 0], [-1, 0]]:
                yi += y
                xi += x
                # print(yi,xi)
                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
        # print(dist)
        return dist[goal[0]][goal[1]]

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

#D
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)
                    # print(tmp)
                    tmp += 1
        # print(tmp)
        ans *= tmp  
        ans %= mod
        q = list(set(q))
        # print(q)
        if q[0] == a:
            break
    print(ans)
    return

#E
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
        # print(x)
    if f:
        print("YES")
    else:
        print("NO")
    return

#F
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

#G
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

#H
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

#Solve
if __name__ == '__main__':
    H()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
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

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
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

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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')

Submission status: Accepted

Solution code:
#!usr/bin/env python3
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

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

v = int(r + g + b)

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

decimal = r*100 + g*10 + b

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - RGB Cards
r, g, b = [s for s in input().split()]
number = int(r + g + b)
print('YES' if number % 4 == 0 else 'NO')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
r, g, b = input().split()
num = int(r+g+b)
if(num % 4 == 0):
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

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

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
# abc065 a
#
import unittest
from io import StringIO
import sys


def input():
    return sys.stdin.readline().rstrip()


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


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """4 3 2"""
        output = """YES"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """2 3 4"""
        output = """NO"""
        self.assertIO(input, output)


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A = 100*r + 10*g + b

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

Submission status: Accepted

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

Submission status: Accepted

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

number = r * 100 + g * 10 + b

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

Submission status: Accepted

Solution code:

r,g,b = input().split()
rgb = r + g + b
rgb = int(rgb)

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

Submission status: Accepted

Solution code:
r,g,b = input().split()
rgb = r + g + b
rgb = int(rgb)

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

Submission status: Accepted

Solution code:
r,g,d =(int(x) for x in input().split())

num = 100 * r + g * 10 + d

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input()[::2])
print("YES" if n&3==0 else "NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# r,g,bにそれぞれ代入
r, g, b = map(int, input().split())
# 3桁の整数を作る
num = (r * 100) + (g * 10 ) + b
#4の倍数か判定
if num % 4 == 0: #numを4で割った余りが0
	print('YES')
else:
	print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R,G,B=input().split()
r=int(R)
g=int(G)
b=int(B)
x=100*r
y=10*g
z=b
p=x+y+z
if p%4==0:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
r=a[0]
g=a[1]
b=a[2]

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

Submission status: Accepted

Solution code:
#64a
r,g,b = map(int, input().split())

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

Submission status: Accepted

Solution code:
r,g,b = map(int,open(0).read().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2019/10/10
list_rgb = list(open(0).read().split())
rgb = "".join(list_rgb)
print("YES" if int(rgb)%4 == 0 else "NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = input().split()

last_2digits = b + c

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

Submission status: Accepted

Solution code:
rgb = int("".join(input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print("YNEOS"[int("".join(list(input().split())))%4!=0::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,g,b=map(int,input().split());print('YNEOS'[(g*10+b)%4!=0::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(str, input().split())
e = a+b+c

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

Submission status: Accepted

Solution code:
s = input().replace(' ', '')

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    rgb = list(map(str, str(input().rstrip('\n')).split()))
    print("YES" if int("".join(rgb)) % 4 == 0 else "NO")


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

num = r*100 + g*10 + b

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    print("YES" if int("".join(input().split())) % 4 == 0 else "NO")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - RGB Cards
r, g, b = map(str,input().split())

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

Submission status: Accepted

Solution code:
# ARC 064 A

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

A=10*g+b

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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