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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 指定時刻の取得
M = int(input())

# 12/30の残り時間と12/31の24時間を加算し結果を出力
total =  M + 24
print(total)

Submission status: Wrong Answer

Solution code:
print(60-int(input()))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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


def main():
    M = int(readline())
    print(24+M%24)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
M=int(input())

print=(48-M)

Submission status: Wrong Answer

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

print=(48-M)

Submission status: Wrong Answer

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

M=48-M

Submission status: Wrong Answer

Solution code:
M = int(input())

print(24 - M)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(21)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
M = int(input())

answer = 24 - M 

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
m = int(input())
if m < 12:
  print(m+24)
else:
  print(48-m)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
print(s.replace("2017", "2018"))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
m = int(input())

print ( 24 - m )

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
m = int(input())

print(24 + m)

Submission status: Wrong Answer

Solution code:
i = int(input())
print(i+24)

Submission status: Wrong Answer

Solution code:
def time(x):
    return 48-int(x)
time(input())

Submission status: Wrong Answer

Solution code:
def a(b):
    print(48-b)

Submission status: Wrong Answer

Solution code:
def a(b):
    return 48-b

Submission status: Wrong Answer

Solution code:
def a(aa):
    return 48-aa

Submission status: Wrong Answer

Solution code:
m=int(input())

print(m+24)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
m = int(input())

print(24-m)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
h = int(input())

print(24 + h)

Submission status: Wrong Answer

Solution code:
h = int(input())

print(24 - h)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
print("2018"+S[4:])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding utf-8 -*-
x = int(input())
print("{}".format(x + 24))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(d)

Submission status: Wrong Answer

Solution code:
#coding:utf-8
n=int(input())
n-=48
print(n)

Submission status: Wrong Answer

Solution code:
m = int(input())
if m > 12:
  print(m+6)
else:
  print(m+24)

Submission status: Wrong Answer

Solution code:
def main(M):
   ans = 48 - M
   return ans

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print("{}".format(int(input()) + 24))

Submission status: Wrong Answer

Solution code:
print("%d\n".format(48-int(input())))

Submission status: Wrong Answer

Solution code:
M = input()

rest = 24 - (int(M)%24)
print(str(rest+24) + "Hours")

Submission status: Wrong Answer

Solution code:
def year(M):
  num = open('M.txt', 'r')
  print(48 - int(num))

Submission status: Wrong Answer

Solution code:
def year(M):
  num = open('M.txt', r)
  return int(48 - int(num))

Submission status: Wrong Answer

Solution code:
def year(M):
  return 48 - int(M)

Submission status: Wrong Answer

Solution code:
def year(M):
  time = int(M)
  left_time = 24 - time
  return left_time + 24

Submission status: Wrong Answer

Solution code:
def year(M):
  left_time = 24 - M
  return left_time + 24

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a=input()
a=int(a)
b=24-a
print(b)

Submission status: Wrong Answer

Solution code:
print(int(input())+12)

Submission status: Wrong Answer

Solution code:
# Try AtCoder
# author: Leonardone @ NEETSDKASU

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

print(a + 24)

Submission status: Time Limit Exceeded

Solution code:
candidates = [2] + list(range(3,100001,2))
i = 1
got_one = True
while got_one:
    p = candidates[i]
    new_candidates = candidates[:i+1]
    for j in candidates[i+1:]:
        if j%p != 0:
            new_candidates.append(j)
    if len(new_candidates) == len(candidates):
        got_one = False
    candidates = new_candidates
    i = i + 1

similar = []
for p in candidates:
    if (p+1)/2 in candidates:
        similar.append(p)

answers = []
n = int(input())
for q in range(n):
    [l, r] = [int(i) for i in input().split()]
    answers.append(sum([l <= p <= r for p in similar]))

for a in answers:
    print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
m = int(input())

print(24+24-m)

Submission status: Accepted

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

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:
n = int(input())
print(48 - n)

Submission status: Accepted

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

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(24 - M + 24)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)

m = int(input())

print(24-m+24)

Submission status: Accepted

Solution code:
# 084_a
M=int(input())
if 1<=M and M<=23:
    result=48-M
    if result>=0:
        print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
M = int(input())

answer = 48 - M
print(answer)

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:
m = int(input())
print(24+(24-m))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
print(48-int(sys.stdin.readline().rstrip()))

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:
def main():
    m = int(input())
    x = 48 - m
    print(x)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - New Year
# https://atcoder.jp/contests/abc084/tasks/abc084_a

M = int(input())

print(48 - M)

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:
x = int(input())
print(48-x)

Submission status: Accepted

Solution code:
time=int(input())
Ans=48-time
print(Ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
M=int(input())

print((24-M)+24)

Submission status: Accepted

Solution code:
# A - New Year

# 12/30のM時から次の年になるのは何時間後か出力する


M = int(input())

print((24 - M) + 24)

Submission status: Accepted

Solution code:
# 12月30日のM時から次の年になるまでは何時間かもとめる

M = int(input())

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

Submission status: Accepted

Solution code:
# 12月30日の M 時から次の年になるまでは何時間か、求めてください。

# 制約
# 1 ≦ M ≦ 23
# 入力は全て整数

# 標準入力から Mの値を取得し、出力する
m = int(input())

# 残り何時間か計算し、出力する
result = 48 - m
print(result)

Submission status: Accepted

Solution code:
m = int(input())

print(24 - m + 24)

Submission status: Accepted

Solution code:
m = int(input())

x = 48 - m

print(x)

Submission status: Accepted

Solution code:
# 入力
M = int(input())

# 48時間から12月30日のM時をひく
time_remaining = 48 - M

# 出力
print(time_remaining)

Submission status: Accepted

Solution code:
M = int(input())

# 31日分は+24、30日分は24-M
print(48 - M)

Submission status: Accepted

Solution code:
#　12月30日のM時から次の年になるまでは何時間か、求めてください。

M = int(input())
print(48 - M) #30日31日の合計48時間から現在の時刻を引くと、残り時間が出せる。

Submission status: Accepted

Solution code:
M = int(input())

print( 24 +(24 - M))

Submission status: Accepted

Solution code:
#   AtCoder abc084 a
#   ストレッチ課題

#   入力
m = int(input())

#   処理(m + x = 48)
x = 48 - m

#   出力
print(x)

Submission status: Accepted

Solution code:
M = int(input())

x = 24 + (24 - M)
print(x)

Submission status: Accepted

Solution code:
# 入力
M = int(input())

# 出力
if 1 <= M <=23:
    print(48 - M)

Submission status: Accepted

Solution code:
from datetime import datetime, date

dt = datetime(date.today().year, 12, 30, int(input()), 0, 0)
td = abs(dt - datetime(dt.year + 1, 1, 1))
answer = int(td.total_seconds() / (60 * 60))
print(answer)

Submission status: Accepted

Solution code:
M = int(input())

answer = 48 - M

print(answer)

Submission status: Accepted

Solution code:
# 入力
M = int(input())

# 処理
x = 48 - M

# 出力
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 12月 30日の M時から次の年になるまでが x時間のとき、xを出力
M = int(input())

print(24 + (24 - M))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 084a

M = int(input())

print(24 + (24 - M))

Submission status: Accepted

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

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
M = int(input())

x = 24 - M
print(x + 24)

Submission status: Accepted

Solution code:
# 指定時刻の取得
M = int(input())
 
# 12/30の残り時間と12/31の24時間を加算し結果を出力
total =  (24 - M) + 24
print(total)

Submission status: Accepted

Solution code:
# M時の時間を整数で入力
M = int(input())
# 12月30日のM時から1月1日0時までの時間を出力
print(48 - M)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
M=int(input())

x=24+(24-M)

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = int(input())

day = 24 + (24 - S)
print (day)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 12月30日のM時から次の年になるまでは何時間か求めろ

# M 時 を標準入力
M = int(input())
# print(M)

# 次の年になる x を求める
# 30日の0時から次の年まで48時間
# M時間過ぎているので、残りは　（48 - M）時間

x = 48 - M
# print(x)

# 答えを代入
answer = x
print(answer)

Submission status: Accepted

Solution code:
# 入力
time = int(input())

# 処理
left_30 = 24 - time
new_year = left_30 + 24

print(new_year)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
M = int(input())

x = 24 + (24 -M)
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
day_of_30th_hour = int(input())

# 31日までの残り時間 + 31日の24時間
left_hour_to_next_year = 48 - day_of_30th_hour
print(left_hour_to_next_year)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding = SJIS

m = int(input())

ans = 48 - m

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

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
sys.setrecursionlimit(10 ** 7)

M = int(input())

res = 48 - M

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]

m = int(input())

print(abs(m-24)+24)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(48-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+24-m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
m = int(input())

print(24-m+24)

Submission status: Accepted

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

Submission status: Accepted

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

print(48-M)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    M = int(readline())
    
    print(48 - M)
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print(eval('48-'+input()))

Submission status: Accepted

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

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:
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

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

    print(48-m)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
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
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

print(48 - INT())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
#N,M = map(int,input().split())
#A = list(map(int,input().split()))

print(24-N+24)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(48-n)

Submission status: Accepted

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

Submission status: Accepted

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

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:
n = int(input())
print((24 - n) + 24)

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# 整数の入力
M = int(input())

print(24+(24-M))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
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 S(): return input()
def LS(): return input().split()


INF = float('inf')


m = I()
ans = 24 + 24 - m
print(ans)

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(2147483647)
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()))

m = I()
print(48 - m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

Solution code:
def solve():
    M = int(input())
    ans = 48-M
    return ans
print(solve())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
M = int(input())

ans = 24-M+24
print(ans)

Submission status: Accepted

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(24+24-n)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(48-int(input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
M = int(input())

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

Submission status: Accepted

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

# check
print(48 - M)

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

print(48-ri())

Submission status: Accepted

Solution code:
M = int(input())

print(48 - M)

Submission status: Accepted

Solution code:
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:
x = int(input())
 
print(24 + (24 - x))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
###==================================================
### import
#import bisect
#from collections import Counter, deque, defaultdict
#from copy import deepcopy
#from functools import reduce, lru_cache
#from heapq import heappush, heappop
#import itertools
#import math
#import string
import sys
### stdin
def input(): return sys.stdin.readline()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]
### stdout
def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))
### setting
sys.setrecursionlimit(10 ** 6)
### utils
int1 = lambda x: int(x) - 1
### constants
INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
###---------------------------------------------------

M = iIn()

ans = 24 + (24 - M)

print(ans)

Submission status: Accepted

Solution code:
print(max(0, 48 - int(input())))

Submission status: Accepted

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

if not ( 1 <= M <= 23):
    sys.exit()

print(24+(24-M))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
M = int(input())
print(24+(24-M))

Submission status: Accepted

Solution code:
M = int(input())

rt30 = 24 - M

x = 24 + rt30

print(x)

Submission status: Accepted

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

m = int(input())

print(48 - m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

M = i()
print(48-M)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(24 + (24 - M))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

M = int(input())

print(48-M)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    M = int(input())

    ans = (24 - M) + 24

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def actual(M):
    return (24 - M) + 24

M = int(input())
print(actual(M))

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)


def main():
    M = int(input().strip())
    return (24 - M) + 24


if __name__ == "__main__":
    print(main())

Submission status: Accepted

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

Submission status: Accepted

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

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:
print(24*2-int(input()))

Submission status: Accepted

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

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:
m = int(input())
print(24 + 24 - m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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