260305
# def prime(n):
# if n == 2:
# print("prime")
# return
# for i in range(2, n):
# if n % i == 0:
# print("composite")
# return
# print("prime")
# n = int(input())
# prime(n)
# def f(n):
# i=1
# while i * i <= n:
# i+=1
# return i-1
# n = int(input())
# print(f(n))
# def f(k):
# global n,m
# for i in range(n):
# if m[i] == k:
# print(i+1)
# return
# print("-1")
# n = int(input())
# m = list(map(int, input().split()))
# k = int(input())
# f(k)
# def f(x):
# a,b = x.split('.')
# print('0.'+b+'0'*(14-len(b)))
# x = input()
# f(x)
# 파이썬 문자열 서식 지정자와 포매팅 사용하는 방법
# a = int(input())
# print("%-05d"%a)
# def f(x):
# if x - int(x) <= 0.5:
# x += 1
# print(x)
# return
# print(int(x))
# x = float(input())
# f(x)
# def f(x):
# t = int(x)
# if t < x:
# x += 1
# print(x)
# return
# print(t)
# x = float(input())
# f(x)
# def f(n):
# a = 0
# for i in range(1, n+1):
# a += i
# print(a)
# n = int(input())
# f(n)
# def f(n):
# a = 1
# for i in range(1, n+1):
# a = a * i
# print(a)
# n = int(input())
# f(n)
# def f(n):
# a = 0
# for i in range(1, n+1):
# if n % i == 0:
# a += 1
# print(a)
# n = int(input())
# f(n)
# 1558번 10으로 나누어서 다른 곳에 하나씩 저장하고 뒤집어서 출력하기
# def f(n):
# a = []
# for i in range(1, n+1):
# b = n % 10
# a.append(b)
# print(a, sep=" ")
# n = int(input())
# f(n)
나머지 다 숙제
# def f(n, m):
# a = n - m
# if a < 0:
# return -a
# else:
# return a
# n, m = map(int, input().split())
# print(f(n, m))
# def f(n, m):
# a = n + m
# return a
# n, m = map(int, input().split())
# print(f(n, m))
# def f(n, m):
# if n < m:
# return m
# else:
# return n
# n, m = map(int, input().split())
# print(f(n, m))
# def f(n, m):
# if n < m:
# return n
# else:
# return m
# n, m = map(int, input().split())
# print(f(n, m))