Problem:


Score : 100 points

Problem Statement

How many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?

Constraints

1≤M≤23

M is an integer.

Input

Input is given from Standard Input in the following format:

M

Output

If we have x hours until New Year at M o'clock on 30th, December, print x.

Sample Input 1

21

Sample Output 1

27

We have 27 hours until New Year at 21 o'clock on 30th, December.

Sample Input 2

12

Sample Output 2

36



Sample input:
21


Sample output:
27

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    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())
    
    
    m = ii()
    print(48 - m)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

m=int(input())

print(48-m)

Submission status: Accepted

Solution code:
m = int(input())

print(48 - m)

Submission status: Accepted

Solution code:
s = input()
s = int(s)
if s == 23:
    print("25")
elif s == 22:
    print("26")
elif s == 21:
    print("27")
elif s == 20:
     print("28")
elif s == 19:
     print("29")
elif s == 18:
     print("30")
elif s == 17:
     print("31")
elif s == 16:
     print("32")
elif s == 15:
     print("33")
elif s == 14:
     print("34")
elif s == 13:
     print("35")
elif s == 12:
     print("36")
elif s == 11:
     print("37")
elif s == 10:
     print("38")
elif s == 9:
     print("39")
elif s == 8:
     print("40")
elif s == 7:
     print("41")
elif s == 6:
     print("42")
elif s == 5:
     print("43")
elif s == 4:
     print("44")
elif s == 3:
     print("45")
elif s == 2:
     print("46")
else:
     print("47")

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

m = int(readline())
print(24+(24-m))

Submission status: Accepted

Solution code:
print(24 + (24 - int(input())))

Submission status: Accepted

Solution code:
m = int(input())
print(24-m+24)

Submission status: Accepted

Solution code:
n = int(input())

print(48 - n)

Submission status: Accepted

Solution code:
i = int(input())
print(24*2-i)

Submission status: Accepted

Solution code:
M=int(input())
print((24-M)+24)

Submission status: Accepted

Solution code:
m = int(input())

print(24 + 24 - m)

Submission status: Accepted

Solution code:
M = int(input())
x = 24 + (24 - M)
print(x)

Submission status: Accepted

Solution code:
m = int(input())
 
print(24-m+24)

Submission status: Accepted

Solution code:
import sys
def ii(): return int(sys.stdin.readline())

M = ii()

print(48-M)

Submission status: Accepted

Solution code:
print(24+(24-int(input())))

Submission status: Accepted

Solution code:
import collections

#文字列を一文字ずつ取得したいとき
def inputStrOnebyOne():
    s = list(input())
    return s

#整数を一つずつリストに入れる
def inputOnebyOne_Int():
    a = list(int(x) for x in input().split())
    return a

def main():
    m = input()
    print(str(48-int(m)))

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(24 * 2 - int(input()))

Submission status: Accepted

Solution code:
a=int(input())
print(48-a)

Submission status: Accepted

Solution code:

m = int(input())

print(48-m)

Submission status: Accepted

Solution code:
import sys
import math
import bisect
 
def main():
    n = int(input())
    print(48 - n)
 
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
M = int(input())

print(24+(24-M))

Submission status: Accepted

Solution code:
m = int(input())

ans = 48 - m
print(ans)

Submission status: Accepted

Solution code:
m = int(input())
print(24 + (24 - m))

Submission status: Accepted

Solution code:
M=int(input())
print (48-M)

Submission status: Accepted

Solution code:
A=int(input())
print(48-A)

Submission status: Accepted

Solution code:
def resolve():
	m = int(input())
	print(24*2 - m)
resolve()

Submission status: Accepted

Solution code:
def ABC_84_A():
    M = int(input())
    
    print(48-M)

if __name__ == '__main__':

    ABC_84_A()

Submission status: Accepted

Solution code:
def main():
    print(24+(24-int(input())))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
m=int(input())

print(48-m)

Submission status: Accepted

Solution code:
n=int(input())
print(24+24-n)

Submission status: Accepted

Solution code:
a=input()
a=int(a)
print(24+24-a)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    M = I()

    print((24-M)+24)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
t = int(input())
print(48 - t)

Submission status: Accepted

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

print(48-int(input()))

Submission status: Accepted

Solution code:
A=int(input())
print(24-A+24)

Submission status: Accepted

Solution code:
M = int(input())
ans = (24-M)+24

print(ans)

Submission status: Accepted

Solution code:
print( 24 - int(input()) + 24 )

Submission status: Accepted

Solution code:
M=int(input())
print(24+(24-M))

Submission status: Accepted

Solution code:
a=int(input())
print(24+24-a)

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop

import collections

m = int(input())
ans = 24 + 24 - m
print(ans)

Submission status: Accepted

Solution code:
m=int(input())
ans=48-m
print(ans)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
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
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

M = INT()
print(48-M)

Submission status: Accepted

Solution code:
M = int(input())
print(24 + (24-M))

Submission status: Accepted

Solution code:
# ABC084A

m = int(input())
print(48-m)

Submission status: Accepted

Solution code:
M = input()
M = int(M)
print (48-M)

Submission status: Accepted

Solution code:
M=int(input())
ans=24+(24-M)
print(ans)

Submission status: Accepted

Solution code:
s = int(input())
def year(m):
    return 48 - m;

print(year(s))

Submission status: Accepted

Solution code:
m = int(input())
ans = 48 - m
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    d = int(stdin.readline())
    ny = 48 - d

    print(ny)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

m=I()
print(48-m)

Submission status: Accepted

Solution code:
import sys
## io
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))
## dp
INIT_VAL = 0
MD2 = lambda d1,d2: [[INIT_VAL]*d2 for _ in range(d1)]
MD3 = lambda d1,d2,d3: [MD2(d2,d3) for _ in range(d1)]
## math
DIVC = lambda x,y: -(-x//y)
DIVF = lambda x,y: x//y

def main():
    m = II()
    print(48-m)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def resolve():
    m=int(input())
    print(24-m+24)
resolve()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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():
    M=int(input())
    print(48-M)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())

print(48 - x)

Submission status: Accepted

Solution code:
m = int(input())
ans = 24+(24-m)
print(ans)

Submission status: Accepted

Solution code:
hour = int(input())
print(48-hour)

Submission status: Accepted

Solution code:
M = int(input())
print((24-M)+24)

Submission status: Accepted

Solution code:
print(int(input()) *-1 + 48)

Submission status: Accepted

Solution code:
M = int(input())
print(24 + 24-M)

Submission status: Accepted

Solution code:
m=int(input())
print((24-m)+24)

Submission status: Accepted

Solution code:
a = int(input())
print(24-a+24)

Submission status: Accepted

Solution code:
M = input()
print(48-int(M))

Submission status: Accepted

Solution code:
def main():
    M = int(input())
    print(48-M)
main()

Submission status: Accepted

Solution code:
n = int(input())

print(48-n)

Submission status: Accepted

Solution code:

def resolve():
    M = int(input())
    print(24 - M + 24)


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
n = int(input())
print(24 + (24 - n))

Submission status: Accepted

Solution code:
icase=0    
if icase==0:
    m=int(input())
    print(48-m)

Submission status: Accepted

Solution code:
n =int(input())
print(48-n)

Submission status: Accepted

Solution code:
M = input()
M = int(M)
X = int(24 - M + 24)
print(X)

Submission status: Accepted

Solution code:
m = int(input())

print(24 + (24 - m))

Submission status: Accepted

Solution code:
m = int(input())

print(24+(24-m))

Submission status: Accepted

Solution code:
m = int(input())

print(24 + (24 - m))

Submission status: Accepted

Solution code:
n = int(input())

ans = 24 + (24 - n)
print(ans)

Submission status: Accepted

Solution code:
M = int(input())

print(24 + 24-M)

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

M = int(input())

print(24 - M + 24)

Submission status: Accepted

Solution code:
nancy = int(input())
print (24-nancy+24)

Submission status: Accepted

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


def solve(M: int):
    print(48 - M)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    M = int(next(tokens))  # type: int
    solve(M)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())
 
print(48-a)

Submission status: Accepted

Solution code:
x=input()
x=int(x)
print(48-x)

Submission status: Accepted

Solution code:
M = int(input())
print(str(24 + (24 - M)))

Submission status: Accepted

Solution code:
M = int(input())
print( 24+(24-M) )

Submission status: Accepted

Solution code:
m=int(input())

print(24+24-m)

Submission status: Accepted

Solution code:
M = int(input())
print(24 * 2 - M)

Submission status: Accepted

Solution code:
m = int(input())
print(2 * 24 - m)

Submission status: Accepted

Solution code:
M = int(input())

print(24-M+24)

Submission status: Accepted

Solution code:
# python 3.4.3
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------



# -------------------------------------------------------------
# main
# -------------------------------------------------------------

M = int(input())
print(48-M)

Submission status: Accepted

Solution code:
# coding: utf-8

M = int(input())
print(24 - M + 24)

Submission status: Accepted

Solution code:
n = int(input())
print(24-n+24)

Submission status: Accepted

Solution code:
Year = 48
print(Year-int(input()))

Submission status: Accepted

Solution code:
M = int(input())

print((24 - M) + 24)

Submission status: Accepted

Solution code:

m = int(input())
print(48-m)

Submission status: Accepted

Solution code:


m = int(input())

print(24 * 2 - m)

Submission status: Accepted

Solution code:
M = int(input())

answer = 24 - M + 24 

print(answer)

Submission status: Accepted

Solution code:
import sys

m = int(sys.stdin.readline().rstrip())

def main():
    print(48 - m)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 084: A – New Year
m = int(input())
print(48 - m)

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    s=int(input())
    s= 24+ (24-s)

    print(s)

Submission status: Accepted

Solution code:
M=int(input())
print((24-M)+24)

Submission status: Accepted

Solution code:
M = int(input())
ans = 48-M

print(ans)

Submission status: Accepted

Solution code:
def main():
    m = int(input())
    ans = 24 - m + 24
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# | Its_Rashid | #
print(48 - int(input()))

Submission status: Accepted

Solution code:
# | Its_Rashid | #
a = int(input())
print(48 - a)

Submission status: Accepted

Solution code:
m = int(input())
print(24 + 24 - m)

Submission status: Accepted

Solution code:
M=int(input())

print(24+(24-M))

Submission status: Accepted

Solution code:
M = int(input())
x = 48 - M

print(x)

Submission status: Accepted

Solution code:
print(24-int(input())+24)

Submission status: Accepted

Solution code:
m=int(input())
print(24-m+24)

Submission status: Accepted

Solution code:
m = int(input())
print(24 *2 - m)

Submission status: Accepted

Solution code:
l = int(input())
print(48-l)

Submission status: Accepted

Solution code:
m = int(input())
print((24-m)+24)

Submission status: Accepted

Solution code:
M=int(input())
print(48-M)

Submission status: Accepted

Solution code:
#abc084 a 
m=int(input())
print(24+24-m)

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Thu Mar 12 20:03:57 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

M = ni()

print((24 - M) + 24)

Submission status: Accepted

Solution code:
print(24 - int(input()) + 24)

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    M = int(sys.stdin.readline().rstrip())
    print(24+(24-M))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# A - New Year
m=int(input())
print((24-m)+24)

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    m = int(input())
    print(48-m)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

m = int(stdin.readline().rstrip())
print(48-m)

Submission status: Accepted

Solution code:
a = int(input())
print(24 + (24-a) )

Submission status: Accepted

Solution code:
t = int(input())
print((24-t)+24)

Submission status: Accepted

Solution code:
T = int(input())
ans = (24-T)+24
print(ans)

Submission status: Accepted

Solution code:
m=input()
print (24-m)+24

Submission status: Accepted

Solution code:
import math
import itertools
import statistics
#n = int(input())
#n, T = list(map(int, input().split()))
m = int(input())
print(24+(24-m))

Submission status: Accepted

Solution code:

def New_Year(m):

    return  24 + (24 - m)

def main():
    m = int(input())
    print(New_Year(m))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
print(abs(n-24)+24)

Submission status: Accepted

Solution code:
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//math.factorial(n-r)*math.factorial(r)


m = int(input())
print(24+(24-m))

Submission status: Accepted

Solution code:
#084_A
print(48-int(input()))

Submission status: Accepted

Solution code:
M = int(input())

print((24-M) + 24)

Submission status: Accepted

Solution code:
M_ji = int(input())
ans = 24 + 24 - M_ji
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
print(24-n+24)

Submission status: Accepted

Solution code:
M = int(input())
print(24 + (24 - M))

Submission status: Accepted

Solution code:
n = int(input())
#a,b = map(int,input().split())
#a_L = list(map(int,input().split()))

print(24+24-n)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#----------
M = int(input().strip())
#----------

print(24+(24-M))

Submission status: Accepted

Solution code:
M = int(input())

ans = 24 + 24-M
print(ans)

Submission status: Accepted

Solution code:
M=int(input())
print(24+24-M)

Submission status: Accepted

Solution code:
a = int(input())
print(24+(24-a))

Submission status: Accepted

Solution code:
M = input()
M = int(M)
print(48 - M)
print()

Submission status: Accepted

Solution code:
x = int(input())
print(24+(24-x))

Submission status: Accepted

Solution code:
a= int(input())
print(48-a)

Submission status: Accepted

Solution code:
m=int(input())
print((24-m)+24)

Submission status: Accepted

Solution code:
def main():
    print(48 - int(input()))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S=int(input())
print(24+(24-S))

Submission status: Accepted

Solution code:
m = int(input())
x = 24-m
print (x+24)

Submission status: Accepted

Solution code:
m = int(input())
print((24-m)+24)

Submission status: Accepted

Solution code:
M = int(input())
print((24 - M) + 24)

Submission status: Accepted

Solution code:
M=input()
M=int(M)

N=24-M

print(N+24)

Submission status: Accepted

Solution code:
a=int(input())
print(24-a+24)

Submission status: Accepted

Solution code:
# 入力 : 数字1つ
M = int(input())

# 出力
print(48 - M)

Submission status: Accepted

Solution code:
m = int(input());print(48 - m)

Submission status: Accepted

Solution code:
m = int(input())

print(24 - m + 24)

Submission status: Accepted

Solution code:
str = input().split()
m = int(str[0])
print(48 - m)

Submission status: Accepted

Solution code:
M = int(input())
ans = 24
ans += 24 - M
print(ans)

Submission status: Accepted

Solution code:
M = int(input())
print(48 - M)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
    M = int(input())
    print((24 * 2 - M))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
m=int(input())
m=48-m
print(m)

Submission status: Accepted

Solution code:
m=int(input())
print(24+24-m)

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(readline())

print(48-N)

Submission status: Accepted

Solution code:
print((24 - int(input())) + 24)

Submission status: Accepted

Solution code:
s = int(input())
print(24-s+24)

Submission status: Accepted

Solution code:
A = int(input())
print(24+(24-A))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(input())
print(48-n)

Submission status: Accepted

Solution code:
M = int(input())

ans = 48 - M

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
#n,m = map(int,input().split())
#lst1 = list(map(int,input().split()))
print(48-n)

Submission status: Accepted

Solution code:
a = int(input())
print(24 + (24 - a))

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# vim: set fileencoding=utf-8:
import sys
input = sys.stdin.readline


def main():
    M = input()
    print((24-int(M))+24)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())

print(24 + (24-N))

Submission status: Accepted

Solution code:
n = int(input())
print(24 + (24-n))

Submission status: Accepted

Solution code:
n=int(input())

print(24-n+24)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from itertools import product, permutations, combinations
from bisect import bisect_right,bisect_left
M=int(input())
print(24+24-M)

Submission status: Accepted

Solution code:
def main():
    m = int(input())

    print(48-m)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
m = int(input())
print((24 - m) + 24)

Submission status: Accepted

Solution code:
M = int(input())

print((24-M)+24)

Submission status: Accepted

Solution code:
M = int(input())
r = 24 - M + 24
print(int(r))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
print(24 + (24 - N))

Submission status: Accepted

Solution code:
n=int(input())
print(24-n+24)

Submission status: Accepted

Solution code:
# 入力

M = int(input())

H = 24 - M + 24

print(H)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
M = int(input())
print(48-M)

Submission status: Accepted

Solution code:
def read_values():
    return map(int, input().split())


def read_list():
    return list(read_values())


def main():
    M = int(input())
    print(48 - M)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
m=int(input())
print(48-m)

Submission status: Accepted

Solution code:
# 時間を受け取る
M = int(input())
# 31日の24時間
hours_on_31 = 24
# 新年までの時間を出力
print(24 - M + hours_on_31)

Submission status: Accepted

Solution code:
N = int(input())
print(24-N+24)

Submission status: Accepted

Solution code:
# coding: utf-8


def main():
    
    hour = int(input())
    
    print(24 - hour + 24)
    
    return 0
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8


def main():
    n = int(input())
    
    print(48 - n)
    
    return 0
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
M = int(input())
print(24 + (24 - M))

Submission status: Accepted

Solution code:
# coding: utf-8
M=int(input())
print(24+(24-M))

Submission status: Accepted

Solution code:
print(list(range(48, 24, -1))[int(input())])

Submission status: Accepted

Solution code:
n=int(input())
print(48-n)

Submission status: Accepted

Solution code:
print(-int(input())+48)

Submission status: Accepted

Solution code:
import sys

m = int(sys.stdin.readline().rstrip())

def main():
    return 48 - m

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

Solution code:
m=int(input())
print(24-m + 24)

Submission status: Accepted

Solution code:
import math

m = int(input())
print(48 - m)

Submission status: Accepted

Solution code:
A = int(input())
print(48 - A)

Submission status: Accepted

Solution code:
M = int( input() )
print( 48 - M )

Submission status: Accepted

Solution code:
n = int(input())
print(48-n)

Submission status: Accepted

Solution code:
m = int(input())

print ( 48 - m )

Submission status: Accepted

Solution code:
m = int(input())

print(24-m + 24)

Submission status: Accepted

Solution code:
x=int(input())
print(24+(24-x))

Submission status: Accepted

Solution code:
m = int(input())

ans = 48- m
print(ans)

Submission status: Accepted

Solution code:
m=int(input())
x=24+(24-m)
print(x)

Submission status: Accepted

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


def MI(): return map(int, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


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


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


show_flg = False
# show_flg = True


def main():
    M = I()

    print(48 - M)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
m=input().rstrip()
m=int(m)
h=48-m
print(h)

Submission status: Accepted

Solution code:
import datetime

M = int(input())
today = datetime.datetime(2019, 12, 30, M)
new_year = datetime.datetime(2020, 1, 1, 0)
td = new_year - today

print(td.days * 24 + td.seconds // 3600)

Submission status: Accepted

Solution code:
m = int(input())
print(24 + 24-m)

Submission status: Accepted

Solution code:
time = input()
time = int(time)

print(48-time)

Submission status: Accepted

Solution code:
M = int(input())
T = (24 - M) + 24
print(T)

Submission status: Accepted

Solution code:
m = int(input())


print(48-m)

Submission status: Accepted

Solution code:
h=int(input())

print((24-h)+24)

Submission status: Accepted

Solution code:
n = int(input().split()[0])
ans = 24 - n + 24
print(ans)

Submission status: Accepted

Solution code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

M=one_int()

print(24+24-M)

Submission status: Accepted

Solution code:
n = int(input())
print(24+(24-n))

Submission status: Accepted

Solution code:
i = int(input())
print(48-i)

Submission status: Accepted

Solution code:
# ABC084a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

m = int(input())
print(48-m)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math

#入力
M = int(input())
#A, B, C, D = map(int, input().split())

print (24-M+24)

Submission status: Accepted

Solution code:
m = int(input())
ans = 48-m
print(ans)