Problem:
 Score : 100 points    Problem Statement Dolphin loves programming contests. Today, he will take part in a contest in AtCoder. In this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as " 21 o'clock". The current time is A o'clock, and a contest will begin in exactly B hours.
When will the contest begin? Answer in 24-hour time.      Constraints  0 \leq A,B \leq 23  A and B are integers.         Input The input is given from Standard Input in the following format:  A  B       Output Print the hour of the starting time of the contest in 24-hour time.        Sample Input 1 9 12      Sample Output 1 21  In this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.       Sample Input 2 19 0      Sample Output 2 19  The contest has just started.       Sample Input 3 23 2      Sample Output 3 1  The contest will begin at 1 o'clock the next day.

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





a,b=mii()

p=a+b

if p>=24:
    p-=24
print(p)

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

print((a+b)%24)

Solution (Python):


LI = lambda: list(map(int, input().split()))


A, B = LI()


def main():
    ans = (A + B) % 24
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
A,B=map(int,input().split())
if A+B>=24:
  print(A+B-24)
else:
  print(A+B)

Solution (Python):
A,B=map(int,input().split())
if A+B>=24:
  print(A+B-24)
else:
  print(A+B)

Solution (Python):
a, b = map(int, input().split())
print((a+b)%24)

Solution (Python):
a=input()
b=a.split(' ')
c=[]

for i in range(2):
  c.append(int(b[i]))

print((c[0]+c[1])%24)

Solution (Python):
A,B=map(int,input().split())
print((A+B)%24)

Solution (Python):
A, B = map(int, input().split()) 
sum = A + B
if sum >= 24:
  sum = sum - 24
print(sum)

Solution (Python):
A,B = [int(i) for i in input().split()]
 
C = A + B
 
if C >=24:
    print(C - 24)
else:
    print(C)

Solution (Python):
A,B = [int(i) for i in input().split()]
if A + B >= 24:
  print(A + B -24)
else:
  print(A+B)

Solution (Python):
A, B = map(int, input().split())

x = A + B

if  x >= 24:
  print(x - 24)
else:
  print(x)

Solution (Python):
a,b=map(int,input().split());print([a+b,a+b-24][a+b>=24])

Solution (Python):
print(eval(input().replace(" ","+"))%24)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)

Solution (Python):
a = list(map(int, input().split()))
print(sum(a)%24)

Solution (Python):
a, b = map(int, input().split())
print((a+b)%24)

Solution (Python):
A,B = map(int,input().split())

print((A+B)% 24)

Solution (Python):

import sys
input = sys.stdin.readline









A,B = map(int,input().split())

print((A+B)%24)

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

if a+b < 24:
  print(a+b)
else:
  print(a+b-24)

Solution (Python):
s = list(map(int, input().split()))
n=s[0]
k=s[1]
print((n+k)%24)

Solution (Python):
a, b = map(int, input().split())
if a + b >= 24:
    print(a+b-24)
else:
    print(a+b)

Solution (Python):
a,b = map(int, input().split())
print(a+b if a+b < 24 else a+b-24)

Solution (Python):
A,B=map(int,input().split())

print(int((A+B)%24))

Solution (Python):
A,B = map(int,input().split())

print((A+B)%24)

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

tmp = a + b
print(tmp % 24)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)

Solution (Python):
A,B = map(int,input().split())

if A+B<=23:
  print(A+B)
else:
  print(A+B-24)

Solution (Python):
a,b=map(int,input().split())
print(int((a+b)%24))

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

print((a+b)%24)

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

if A+B >= 24:
  print(A+B-24)
else:
  print(A+B)

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

time = a + b
if time > 23:
    print(time - 24)
else:
    print(time)

Solution (Python):
A, B = map(int, input().split())
print(A+B if A+B<=23 else A+B-24)

Solution (Python):
a, b = map(int, input().split())
c = a + b
if c < 24:
    print(c)
else:
    c -= 24
    print(c)

Solution (Python):
a,b=map(int,input().split())
if a+b<24:
    print(a+b)
else:
    print(a+b-24)

Solution (Python):
a,b=map(int,input().split())
ans=a+b
if ans>=24:
    print(ans%24)
else:
    print(ans)

Solution (Python):
t1,t2 = list(map(int,input().strip().split()))

print((t1+t2)%24)

Solution (Python):
a,b=map(int,input().split())
if a+b >= 24:
  print((a+b)-24)
else:
  print(a+b)

Solution (Python):
A,B=map(int,input().split())
print((A+B) % 24)

Solution (Python):
A,B = map(int,input().split())

ans1 = A + B


if ans1 >= 24:
    ans2 = ans1 - 24
    print(ans2)
else:
    print(ans1)

Solution (Python):
time_input = input()
time = time_input.split()

A = int(time[0])
B = int(time[1])

if A + B >= 24:
    print(A + B - 24)

else:
    print(A + B)

Solution (Python):
time_input = input()
time = time_input.split()

A = int(time[0])
B = int(time[1])

if A + B > 24:
    print(A + B - 24)
elif A + B == 24:
    print(0)
else:
    print(A + B)

Solution (Python):
_input = input().split(" ")
_A = int(_input[0])
_B = int(_input[1])

if _A + _B < 24:
  print(_A + _B)
else:
  print(_A + _B - 24)

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    A, B = map(int, readline().split())
    print((A+B)%24)


if __name__ == '__main__':
    main()

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div

A, B = ri_()
print((A + B) % 24)

Solution (Python):
a, b = list(map(int, input().split()))
h = a + b
if h >= 24:
    h = h - 24
print(h)

Solution (Python):
a, b = map(int, input().split())
if a + b < 24:
  print(a + b)
else:
  print(a + b - 24)

Solution (Python):
a, b = map(int, input().split())
if 0 <= a <= 23 and 0 <= b <= 23:
  c = a + b
  if c >= 24:
    print(c - 24)
  else:
    print(c)

Solution (Python):
a,b=map(int, input().split())
print((a+b)%24)

Solution (Python):
a, b = map(int, input().split())
start = a+b
if start >= 24:
    start = start - 24

print(start)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)

Solution (Python):
a,b=map(int,input().split())
print(a+b-24 if a+b>=24 else a+b)

Solution (Python):
a, b = map(int, input().split())
ans = a + b
if ans >= 24:
    ans = ans - 24
print(ans)

Solution (Python):
a,b = map(int,input().split())
if a+ b >=24:
  print(a+b-24)
else:
  print(a+b)

Solution (Python):
a,b = map(int,input().split())
print((a+b)%24)

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


if a + b < 24:
    print(a + b)
else:
    print(a + b - 24)

Solution (Python):
a, b = map(int,input().split())
if a+b >= 24:
    print(a + b -24)
else:
    print(a+b)

Solution (Python):
a,b,=map(int,input().split())
if a+b<24:
    print(a+b)
else:
    print(a+b-24)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)

Solution (Python):
a,b=map(int,input().split())
if a+b>23:
  print (a+b-24)
else:
  print(a+b)

Solution (Python):
A, B = map(int, input().split())
print((A+B) % 24)

Solution (Python):


a,b = map(int, input().split())

print((a+b)%24)

Solution (Python):
A, B = map(int, input().split())

if A + B < 24:
    print(A+B)
else:
    print(A+B-24)

Solution (Python):
A, B = map(int, input().split())
print((A+B)%24)

Solution (Python):
A,B=map(int,input().split())
if A+B<24:
  print(A+B)
else:
  print((A+B)-24)

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = mi()
    print((a + b) % 24)


if __name__ == "__main__":
    main()

Solution (Python):

a,b=map(int,input().split())
x=a+b
if x<24:print(x)
else:print(x-24)

Solution (Python):
A,B = map(int,input().split())
if A+B <24:
    print(A+B)
else:
    print(A+B-24)

Solution (Python):
a,b=map(int,input().split())
x=a+b
if x>=24:
    print(x-24)
else:
    print(x)

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

print((a+b)%24)

Solution (Python):
a,b, = map(int,input().split())
print((a+b)%24)

Solution (Python):
a, b = map(int, input().split())
print(a + b) if a + b < 24 else print(a + b - 24)

Solution (Python):
a,b=map(int, input().split());print((a+b)%24)

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

    ans = a + b
    if ans >= 24:
        ans -= 24

    print(ans)
resolve()

Solution (Python):

a, b = map(int, input().split())
if a+b >= 24:
    print(a+b-24)
else:
    print(a+b)

Solution (Python):
n = input().split()
a = int(n[0])
b = int(n[1])
c = a+b
if c >= 24:
  c -= 24
print(c)

Solution (Python):
A,B = map(int,input().split())
print(A+B if A+B<24 else A+B-24)

Solution (Python):
A, B = map(int, input().split())
print(A + B if A + B < 24 else (A + B) - 24)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
A,B = map(int,input().split())
print((A+B)%24)

Solution (Python):
a,b=map(int,input().split())
ans=a+b
if ans>=24:
    print(ans%24)
else:
    print(ans)

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



def VI(N, init=0):
  return [init for _ in range(N)]
def VVI(N, M, init=0):
  return [[init for _ in range(M)] for _ in range(N)]

def VD(N, init=0.0):
  return [init for _ in range(N)]
def VVD(N, M, init=0.0):
  return [[init for _ in range(M)] for _ in range(N)]

A, B = map(int, input().rstrip().split())
print((A+B)%24)

Solution (Python):
A,B = map(int,input().split())
print((A+B)%24)

Solution (Python):
a, b = map(int, input().split())
ans = a + b if a + b <= 23 else a + b - 24
print(ans)

Solution (Python):
A, B = map(int, input().split())
def Main(A, B):
    return (A+B)%24
    
print(Main(A, B))

Solution (Python):
a,b=map(int,input().split());i=a+b
if i>=24:
    print(i-24)
else:
    print(i)

Solution (Python):
print(eval(input().replace(' ','+'))%24)

Solution (Python):
print(eval(input().replace(" ","+"))%24)

Solution (Python):
A,B = map(int,input().split())

print((A+B)%24)

Solution (Python):
A,B = map(int,input().split())
if A+B<24:
    print(A+B)
elif A+B>=24:
    print(A+B-24)

Solution (Python):
print(sum(map(int, input().split())) % 24)

Solution (Python):
x, y = map(int, input().split())
print((x+y)%24)

Solution (Python):
a, b = list(map(int, input().split()))
print(a + b if a + b < 24 else a + b - 24)

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

x = a + b
if x >= 24:
   print(x - 24)
else:
   print(x)

Solution (Python):
a,b = map(int, input().split())
print((a+b)%24)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    A,B=map(int,input().split())
    print((A+B)%24)

if __name__ == '__main__':
    main()

Solution (Python):


a, b =  map(int, input().split())
print((a + b)% 24)

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

print((a + b) % 24)

Solution (Python):
def main():
  num = list(map(int,input().split()))
  print((num[0]+num[1])%24)

main()

Solution (Python):
A, B = map(int, input().split())

ans = (A+B) % 24
print(ans)

Solution (Python):
a, b = map(int, input().split())
print((a+b)%24)

Solution (Python):
A,B = map(int, input().split())
if A+B <= 23:
    print(A+B)
else:
    print(A+B-24)

Solution (Python):
a, b = map(int, input().split())
print((a + b)%24)

Solution (Python):
A,B=map(int,input().split())
print((A+B)%24)

Solution (Python):
A,B=map(int,input().split())
print((A+B)%24)

Solution (Python):
A, B = map(int, input().split())
print((A + B) % 24)

Solution (Python):
A, B = map(int, input().split())
print((A+B)%24)

Solution (Python):
A, B = map(int,input().split())
print((A+B)%24)

Solution (Python):
a,b = map(int, input().split())
if a+b >= 24:
  print(a+b-24)
else:
  print(a+b)

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

print((a+b)%24)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)

Solution (Python):
A, B = map(int, input().split())
if A + B >= 24:
    print(A + B - 24)
else:
    print(A + B)

Solution (Python):
A, B = map(int, input().split())
if A + B >= 24:
    print((A + B) - 24)
else:
    print(A + B)

Solution (Python):
a, b = map(int, input().split())
if a+b >=24:
    print(a+b-24)
else:
    print(a+b)

Solution (Python):
A,B=map(int,input().split())
if ((A+B)<24):
    print (A+B)
else:
    print ((A+B)-24)

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

if a + b >= 24:
    print(a + b - 24)
else:
    print(a+b)

Solution (Python):

"""
Created on Thu May 14 16:42:47 2020

@author: shinba
"""

a,b = map(int,input().split())

if a+b < 24:
    print(a+b)
else:
    print(a+b-24)

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

ans = (a + b)%24

print(ans)

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

ans = a + b
if ans > 23:
    ans -= 24

print(ans)

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

print ((a+b) % 24)

Solution (Python):
def main():
    a, b = map(int, input().split())
    if a+b <= 23:
        ans = a+b
    else:
        ans = (a+b)-24
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
A, B = map(int, input().split())
print((A + B) % 24)

Solution (Python):
a, b = map(int, input().split())
if a + b >= 24:
    print((a+b)-24)
else:
    print(a+b)

Solution (Python):
a, b = map(int, input().split())
print((a+b)%24)

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





A,B = inputIL()

print((A+B)%24)

Solution (Python):

A, B = map(int, input().split())
print((A + B) % 24)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
A,B =map(int, input().split())
print((A+B)%24)

Solution (Python):
A,B = map(int,input().split())
sum = A+B

if sum >= 24:
    print(sum-24)
else:
    print(sum)

Solution (Python):
A,B = map(int, input().split())


print((A + B) % 24)

Solution (Python):
t1, t2 = map(int, input().split())

t_start = (t1 + t2) % 24
print(t_start)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
print(eval(input().replace(" ", "+")) % 24)

Solution (Python):
A,B=map(int,input().split())
print((A+B)%24)

Solution (Python):
A, B = map(int, input().split())
print((A+B) % 24)

Solution (Python):
A,B=map(int,input().split())
print((A+B)%24)

Solution (Python):
A,B=map(int,input().split())
print((A+B)%24)

Solution (Python):
a,b = map(int,input().split())
ans = a+b
if ans >= 24:
    ans = ans -24
print(ans)

Solution (Python):
A, B = map(int, input().split())
x = A + B
print(x if x < 24 else (0 if x == 24 else x - 24))

Solution (Python):

def ABC_57_A():
    A,B = map(int, input().split())
    
    if A+B < 24:
        print(A+B)
    else:
        print(A+B-24)

if __name__ == '__main__':

    ABC_57_A()

Solution (Python):
A, B = map(int, input().split())

time = A + B
if time >= 24:
  time = time - 24
print(time)

Solution (Python):
A, B= list(map(int,input().split()))
if A+B > 23:
    print(A+B-24)
else:
    print(A+B)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B = MAP()

print((A+B)%24)

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

print( (a+b) % 24 )

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

a,b = map(int,input().split())
if a + b>=24:
    print(a+b-24)
else:
    print(a + b)

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

if a+b<=23:
  print(a+b)
else:
  print(a+b-24)

Solution (Python):
def main():
    a,b = (int(x) for x in input().split())
    print((a+b)%24)

if __name__ == '__main__':
    main()

Solution (Python):
A, B = map(int, input().split())
hours = [i for i in range(24)]
res = hours[(A+B)%24]
print(res)

Solution (Python):
A, B = list(map(int,input().split()))
print((A+B)%24)

Solution (Python):
print(eval(input().replace(" ","+"))%24)

Solution (Python):
p=eval(input().replace(" ","+"));print(p-24if p>23else p)

Solution (Python):
A, B = map(int, input().split())
print((A + B) % 24)

Solution (Python):
a, b = map(int, input().split())
print((a+b)%24)

Solution (Python):
a, b = map(int, input().split())
print((a+b)%24)

Solution (Python):
a,b = map(int,input().split())
print((a+b)%24)

Solution (Python):
A,B = map(int,input().split())
print((A+B)%24)

Solution (Python):
a, b = map(int, input().split())
if a + b > 23:
  print(a + b - 24)
else:
  print(a + b)

Solution (Python):
a,b = map(int,input().split())
ans = a + b
if ans >= 24: ans -= 24
print(ans)

Solution (Python):
A,B=map(int,input().split());print(abs(A+B-24)if 24<=A+B else A+B)

Solution (Python):
a, b = map(int, input().split())
print(a+b-24 if a+b >= 24 else a+b)

Solution (Python):
a,b = map(int,input().split())
print((a+b)%24)

Solution (Python):


A, B = map(int, input().split())

print((A+B)%24)

Solution (Python):
a,b=map(int,input().split())
print(a+b if a+b<24 else a+b-24)

Solution (Python):
A, B = map(int, input().split())
print( (A+B)%24 )

Solution (Python):
a, b = map(int, input().split())
ans = a + b
if ans >= 24:
    ans -= 24
print(ans)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
A, B = map(int, input().split())
print((A+B) % 24)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)

Solution (Python):
A, B = map(int, input().split())

num = A+B
if num >= 24:
    print(num-24)
else:
    print(num)

Solution (Python):
a,b=map(int,input().split())
ans=(a+b)%24
print(ans)

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

if a+b>=24:
    print((a+b)-24)
else:
    print(a+b)

Solution (Python):
a, b = map(int, input().split())
c = a+b
if c >= 24:
    print(c-24)
else:
    print(c)

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

if a + b < 24:
  print(a + b)
else:
  print(a + b - 24)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
n = input().split()
a = int(n[0])
b = int(n[1])
c = a+b
if c >= 24:
  c -= 24
print(c)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
a, b = map(int, input().split())
print((a+b)%24)

Solution (Python):
a=list(map(int,input().split()))
if sum(a)>=24:
  print(sum(a)%24)
else:
  print(sum(a))

Solution (Python):
A,B = map(int,input().split())

print(A+B if A+B < 24 else A+B-24)

Solution (Python):
a, b = map(int, input().split())
a += b
print(a%24)

Solution (Python):
A,B = map(int,input().split())

print((A+B)%24)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
A,B = map(int, input().split())
Ans = A + B

if Ans <= 23:
    print(Ans)
else:
    print(Ans-24)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

a,b=MI()
print((a+b)%24)

Solution (Python):

def resolve():
    A, B = list(map( int, input().split() ))
    print(A+B if A+B < 24 else A+B-24)


if '__main__' == __name__:
    resolve()

Solution (Python):
a, b = map(int, input().split())
print((a+b) % 24)

Solution (Python):
a,b = map(int, input().split())
print((a+b)%24)

Solution (Python):
a, b = map(int, input().split())
print((a+b) % 24)

Solution (Python):
a,b=map(int, input().split())
if a + b <24:
  print(a+b)
else:
  print(a+b-24)

Solution (Python):
a,b=map(int,input().split())
if a+b<24:
  print(a+b)
else:
  print(a+b-24)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
a,b=map(int,input().split())
if a+b>=24:
  print(a+b-24)
else:
  print(a+b)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

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

if a + b >= 24:
    print(a + b - 24)
else:
    print(a + b)

Solution (Python):
A,B = map(int,input().split())

time = A + B
if time >= 24:
  time -= 24
print(time)

Solution (Python):
a, b = map(int, input().split())
print((a + b if a + b < 24 else a + b - 24))

Solution (Python):
a,b = map(int,input().split())
if a+b >=24:
  print(a+b-24)
else:
  print(a+b)

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

print((a + b) % 24)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)

Solution (Python):
def resolve():
	a, b = map(int, input().split())
	ans = a + b if 24 - (a + b) > 0 else (a + b) - 24
	print(ans)
resolve()

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

if a + b >= 24:
    print(a + b - 24)
else:
    print(a + b)

Solution (Python):
a,b=[int(i) for i in input().split()]
print((a+b)%24)

Solution (Python):
x, y = map(int,input().split())
z = x+y
print(z) if z < 24 else print(z-24)

Solution (Python):
A, B = map(int,input().split())
print((A+B) % 24)

Solution (Python):
a, b = map(int, input().split())
print((a+b)%24)

Solution (Python):
def resolve():
    a,b=map(int,input().split())
    if a+b>=24:
        print(a+b-24)
    else:
        print(a+b)
resolve()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

    a,b=map(int,input().split())
    print((a+b)%24)

resolve()

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

A = a+b
B = A%24
print(B)

Solution (Python):
A, B = map(int, input().split())
print((A+B)%24)

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

ans = a+b

if ans > 23:
    ans = ans - 24

print(ans)

Solution (Python):
a, b = map(int, input().split())
ans = a+b
     
if ans >=24:
  ans = ans-24
      
print(ans)

Solution (Python):
A,B=map(int,input().split())
if A+B<24:
    ans=A+B
else:
    ans=A+B-24
print(ans)

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

ans = a+b

if ans >= 24:
  ans = ans -24
  
print(ans)

Solution (Python):
a,b=map(int, input().split())
print((a+b)%24)

Solution (Python):
A, B = map(int, input().split())
print((A+B)%24)

Solution (Python):
a,b = map(int,input().split())
print((a+b)%24)

Solution (Python):
a, b = list(map(int,input().split()))
print(a + b if a + b <=23 else a + b -24)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)

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

s=a+b
s=s%24
print(s)

Solution (Python):
A, B = map(int,input().split())
print((A+B)%24)

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

if result > 24:
    print(result-24)
elif result == 24:
    print(0)
else:
    print(result)

Solution (Python):
A,B = map(int,input().split())

print(A+B if A+B<24 else A+B-24)

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

print((a+b)%24)

Solution (Python):
A, B = map(int, input().split())
print((A + B) % 24)

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

if b+a>23:
    s=b-(24-a)
else:
    s=a+b
    
print(s)

Solution (Python):
A,B = map(int,input().split())

print((A+B)%24)

Solution (Python):
A,B = map(int, input().split())
ans = (A + B) % 24
print(ans)

Solution (Python):
a,b=map(int,input().split())
if a+b<24:
  print(a+b)
else:
  print(a+b-24)

Solution (Python):
a,b=map(int,input().split())
a+=b;
if a>23:
    print(a-24)
else :
    print(a)

Solution (Python):
a,b = map(int,input().split())
print((a+b)%24)

Solution (Python):
a,b = map(int,input().split())
print((a+b)%24)

Solution (Python):
A, B = map(int, input().split())
print((A+B) % 24)

Solution (Python):
A, B = map(int, input().split())
print(A+B-24 if A+B >= 24 else A+B)

Solution (Python):
a,b=map(int,input().split())
if a+b>=24:
    print((a+b)-24)
else:
    print(a+b)

Solution (Python):
icase=0
if icase==0:
    a,b=map(int,input().split())
    print((a+b)%24)

Solution (Python):
def main():
    A, B = map(int, input().split())

    next = A + B
    if next >= 24:
        next -= 24

    print(next)
main()

Solution (Python):

A, B = map(int, input().split())
ans = A + B
if ans > 24:
    ans = ans - 24

if ans == 24:
    print(0)
else:
    print(ans)

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

print((a + b) % 24)

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

print((a+b) % 24)

Solution (Python):
a,b=map(int,input().split())
ans=a+b
if ans<24:
    print(ans)
else:
    ans-=24
    print(ans)

Solution (Python):
A,B = map(int,input().split())

print((A+B)%24)

Solution (Python):
A, B = map(int, input().split())
print((A+B) % 24)

Solution (Python):
a,b = map(int,input().split())
print((a+b)%24)

Solution (Python):
A,B=map(int,input().split())
print((A+B)%24)

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

print((a+b)%24)

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

print((a+b)%24)

Solution (Python):
a,b=map(int, input().split())
print((a+b)%24)

Solution (Python):


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

print((n + m) % 24)

Solution (Python):
a, b = map(int, input().split())
if (a+b)<24:
    print(a+b)
else:
    print(a+b-24)

Solution (Python):
a, b = map(int, input().split())
ans = (a+b)%24
print(ans)

Solution (Python):
a, b = [int(x) for x in input().split()]
print(a + b) if a + b < 24 else print(a + b - 24)

Solution (Python):
a, b = map(int, input().split())
if a + b <= 23:
    print(a + b)
else:
    print((a + b) - 24)

Solution (Python):
A, B = map(int, input().split())
print((A+B)%24)

Solution (Python):
a,b=map(int,input().split())
print((a+b)%24)

Solution (Python):
A, B = map(int, input().split())
print((A + B) % 24)

Solution (Python):
A, B = map(int, input().split())

AB = A + B
if AB >= 24:
    print(AB - 24)
else:
    print(AB)

Solution (Python):
A, B = map(int, input().split())
print((A + B) % 24)

Solution (Python):
print(sum(map(int,input().split()))%24)

Solution (Python):
print(eval(input().replace(" ","+"))%24)

Solution (Python):
A,B = map(int,input().split())

print((A+B) % 24)

Solution (Python):
A, B = map(int, input().split())
T = A+B
if (T < 24):
    print(T)
else:
    print(T-24)

Solution (Python):
a,b = map(int,input().split())
print((a+b)%24)

Solution (Python):
a, b = map(int, input().split())
print((a+b)%24)

Solution (Python):
a, b = map(int,input().split())
print((a+b)%24)

Solution (Python):
a,b = map(int, input().split())
if a + b >= 24:
  print(a + b - 24)
else:
  print(a + b)

Solution (Python):
a, b = map(int, input().split())
print((a + b) % 24)