<file_sep>N = input()
sizeN = len(N)

minval = int(N) - 9*sizeN if int(N) - 9*sizeN >= 0 else 0
maxval = int(N) + 1

for num in range(minval, maxval):
    listNum = list(map(int, str(num)))
    
    if int(N) == num + sum(listNum):
        print(num)
        break
    elif int(N) == num:
        print(0)<file_sep>N = int(input())

numbers = []
for i in range(N):
    numbers.append(int(input()))

for i in range(N-1):
    for j in range(i, N):
        if numbers[i] > numbers[j]:
            numbers[i], numbers[j] = numbers[j], numbers[i]            

for num in numbers:
    print(num)

<file_sep>import math

T = int(input())

case = []
for i in range(T):
    case.append(input().split())

for idx in case:
    x1, y1, r1, x2, y2, r2 = map(int, idx)

    dist = math.sqrt(pow((x2-x1),2)+pow((y2-y1),2))
    r = [r1, r2, dist]
    mr = max(r)
    r.remove(mr)

    if dist==0 and r1==r2:
        print("-1")
    elif dist==r1+r2 or mr==sum(r):
        print("1")
    elif mr > sum(r):
        print("0")
    else:
        print("2")  <file_sep>n = int(input())
words = []
for i in range(0, n):
    words.append(input())

count = n
for word in words:
    for i in range(0, len(word)-1):
        if word[i] == word[i+1]:
            pass
        else:
            if word[i] in word[(i+1):]:
                count -= 1
                break

print(count)<file_sep>import math

T = int(input())
xy = []
for i in range(T):
    x, y = map(int, input().split())
    xy.append((x,y))


for xx, yy in xy:
    count = 0
    
    dist = yy - xx
    sq = round(math.sqrt(dist))
    
    if sq*sq < dist <= sq*sq + sq:
        count = 2*sq
    else:
        count = 2*sq - 1    

    print(count)

'''
20  12344321     4^2+4 8         4.xxx
25  123454321    5^2 9           5
30  1234554321   5^2+5 10(2i)    5.xxx
36  12345654321  6^6  11(2i-1)   6
'''<file_sep>import sys
sys.setrecursionlimit(100000)

needed = 0
def calMoney(price, count):
    global needed
    needed += price*count
    if count > 0:
        return calMoney(price, count-1)
    else:
        return needed

def solution(price, money, count):    
    rest = money - calMoney(price, count) 
    answer = -1*rest if rest<0 else 0
    
    return answer<file_sep>from itertools import combinations

N, M = map(int, input().split())
cards = list(map(int, input().split()))

cmb = list(combinations(cards, 3))

s = []
for idx in cmb:
    s.append(M-sum(idx))

minval = 100001
minarg = -1
for idx, value in enumerate(s):
    if 0 <= value < minval:
        minval = value
        minarg = idx

print(sum(cmb[minarg]))<file_sep>def Fibonacci(k):
    if k > 2:
        return Fibonacci(k-1) + Fibonacci(k-2)
    elif k==1 or k==2:
        return 1
    else:
        return 0

n = int(input())
print(Fibonacci(n))<file_sep>A, B, V = map(int, input().split())
day=0

step = A - B
h = V - A

if h%step == 0:
    day = h // step +1
else:
    day = h // step +2

print(day)