Harryxun/stf_run huggingface dataset:
B
# -*- coding: utf-8 -*-
box = []
for i in range(0,5):
    box.append(int(input()))
amari = []
for i in range(0,5):
    amari.append(box[i] % 10)
for i in range(0,5):
    if amari[i] ==0:
        amari[i] = 100
    else:
        pass
sumtime = 0
box4 = box[4]
boxmin = box[amari.index(min(amari))]
box[amari.index(min(amari))] = box4 
box[4] = boxmin
for i in range(0,5):
    if i ==4:
        sumtime += box[i]
    elif box[i]%10==0:
        sumtime +=box[i]
    else:
        sumtime += ((box[i]//10)*10+10)
print(sumtime)

### FIXED CODE ###

# -*- coding: utf-8 -*-
box = []
for i in range(0,5):
    box.append(int(input()))
amari = []
for i in range(0,5):
    amari.append(box[i] % 10)
for i in range(0,5):
    if amari[i] ==0:
        amari[i] = 100
    else:
        pass
sumtime = 0
box4 = box[4]
boxmin = box[amari.index(min(amari))]
box[amari.index(min(amari))] = box4 
box[4] = boxmin
for i in range(0,5):
    if i ==4:
        sumtime += box[i]
    elif box[i]%10==0:
        sumtime +=box[i]
    else:
        sumtime += (box[i] // 10)*10+10
print(sumtime)
s = input()
if s = 'ABC':
	print('ARC')
elif s = 'ARC':
	print('ABC')

### FIXED CODE ###

s = input()
if s == 'ABC':
  print('ARC')
elif s == 'ARC':
  print('ABC')
x = int(input())
if x < 4:
  print(1)
  exit()
import math
for i in range(2,x):
  if math.floor(math.log(x,i))>1:
    result = max(result, i ** math.floor(math.log(x,i)))
print(result)

### FIXED CODE ###

x = int(input())
if x < 4:
  print(1)
  exit()
import math
result = 1
for i in range(2,x+1):
  if math.floor(math.log(x,i)+1/100000) > 1:
    result = max(result, i ** math.floor(math.log(x,i)+1/100000))
  
print(result)
import sys

def main(args):
    ans = [1,2,3,4,5]
    given = [int(i) for i in args]

    for i in range(len(ans)):
        if ans[i] != given[i]:
            print(i)
            break

main(sys.argv[1:])

### FIXED CODE ###

#!python
given = [int(i) for i in input().split()]
ans = [1,2,3,4,5]

for i in range(len(ans)):
    if ans[i] != given[i]:
        print(ans[i])
        break
s=int(input())
k=int(input())

for i in range(min(len(str(s),k))):
    if str(s)[i]!='1':
        print(str(s)[i])
        exit()
print(1)
   

### FIXED CODE ###

s=int(input())
k=int(input())

for i in range(min(len(str(s)),k)):
    if str(s)[i]!='1':
        print(str(s)[i])
        exit()
print(1)
x, y = int(input().split(),16)
if x > y:
    print(">")
elif x < y:
    print("<")
else:
    print("=")

### FIXED CODE ###

x, y = input().split()
if x < y:
    print("<")
elif x > y:
    print(">")
else:
    print("=")
s=input()
if s==ABC:
  print("ARC")
else:
  print("ABC")
   

### FIXED CODE ###

s=input()
if s=="ABC":
  print("ARC")
else:
  print("ABC")
N,C=map(int,input().split())
List=[[int(i) for i in input().split()] for i in range(N)]
Time=[[0]*(10**5+1)]*C
for i in range(N):
  T_c=list(Time[List[i][2]-1])
  T_c[List[i][0]-1:List[i][1]]=[1]*(List[i][1]-List[i][0]+1)
  Time[List[i][2]-1]=list(T_c)
T=0
T_max=0
for t in range(10**5):
  for c in range(C):
    T+=Time[c][t]
  if T_max<T:
    T_max=T
  T=0
print(T_max)
print(a)

### FIXED CODE ###

N,C=map(int,input().split())
Time=[[0]*(10**5+1) for c in range(C)]
for i in range(N):
  s,t,c=map(int,input().split())  
  Time[c-1][s-1:t] = [1]*(t-s+1)
Times=max(map(sum,zip(*Time)))
print(Times)
import sys
patterns = [[1, 2, 1, 2, 1, 4, 1, 4],
 [1, 2, 1, 4, 1, 4, 1, 2],
 [1, 4, 1, 4, 1, 2, 1, 2],
 [2, 1, 2, 1, 4, 1, 4, 1],
 [2, 1, 4, 1, 4, 1, 2, 1],
 [4, 1, 2, 1, 2, 1, 4, 1],
 [4, 1, 4, 1, 2, 1, 2, 1],
]

for line in sys.stdin:
	if not line: continue
	p = [int(x) for x in line.split()]
	m = sum(p)
	pt = None
	for ptn in patterns:
		rem = sum(max(0, v - x) for v, x in zip(ptn, p))
		if rem < m:
			m = rem
			pt = ptn
	print " ".join([str(x) for x in pt])

### FIXED CODE ###

import sys
patterns = [
	[1, 2, 1, 2, 1, 4, 1, 4],
	[1, 2, 1, 4, 1, 4, 1, 2],
	[1, 4, 1, 2, 1, 2, 1, 4],
	[1, 4, 1, 4, 1, 2, 1, 2],
	[2, 1, 2, 1, 4, 1, 4, 1],
	[2, 1, 4, 1, 4, 1, 2, 1],
	[4, 1, 2, 1, 2, 1, 4, 1],
	[4, 1, 4, 1, 2, 1, 2, 1],
]

while True:
	try:
		p = [int(x) for x in raw_input().split()]
		m = 999999999
		for ptn in patterns:
			rem = sum(max(0, v - x) for v, x in zip(ptn, p))
			if rem < m:
				m = rem
				pt = ptn
		print " ".join([str(x) for x in pt])
	except:
		break
# ３桁の整数の入力
s = input('')
i = 0
# 1から3桁目までの繰り返し
for j in range(3):
  # 1桁目のチェック
  if s[j] == '1':
    i += 1
    else:
      i += 0
print(i)


### FIXED CODE ###

# ３桁の整数の入力
s = input()
i = 0
# 1から3桁目までの繰り返し
for j in range(3):
# 1桁目のチェック
	if s[j] == '1':
		i += 1
	else:
		i += 0

print(i)
H, W = map(int, input().split(" "))

result = True
masu = [["0" for i in range(H+2)] for j in range(W+2)]
for h in range(1, H+1):
    s = "0"+input()+"0"
    masu[h] = list(s)

# print(masu)    

for h in range(1, H+1):
    for w in range(1, W+1):
        # print(h, w, masu[h][w])
        if masu[h][w] == "#":
            if masu[h+1][w] != "#" and masu[h][w+1] != "#" and masu[h-1][w] != "#" and masu[h][w-1] != "#":
                result = False
                break

if result:
    print("Yes")
else:
    print("No")

### FIXED CODE ###


H, W = map(int, input().split(" "))

# result = True
masu = [['.' for i in range(W+2)] for j in range(H+2)]
for h in range(H):
    s = "."+input()+"."
    masu[h+1] = s

# print(masu)

for h in range(1,H+1):
    for w in range(1,W+1):
        if masu[h][w] == "#":
            if "#" == masu[h+1][w] or "#" == masu[h][w+1] or "#" == masu[h-1][w] or "#" == masu[h][w-1]:
                pass
            else:
                # result = False
                print("No")
                exit()

print("Yes")
def solve(a,b,c,turn):
    	if turn == "a":
    		if a == "":
    			return "A"
    		else:
    			next_turn = a[0]
    			a = a[1:]
    	elif turn == "b":
    		if b == "":
    			return "B"
    		else:
    			next_turn = b[0]
    			b = b[1:]
    	else
    		if c == "":
    			return "C"
    		else:
    			next_turn = c[0]
    			c = c[1:]
    	return solve(a,b,c, next_turn)
    a=input().strip()
    b=input().strip()
    c=input().strip()
    print(solve(a,b,c,"a"))

### FIXED CODE ###

def solve(a,b,c,turn):
	if turn == "a":
		if a == "":
			return "A"
		else:
			next_turn = a[0]
			a = a[1:]
	elif turn == "b":
		if b == "":
			return "B"
		else:
			next_turn = b[0]
			b = b[1:]
	else:
		if c == "":
			return "C"
		else:
			next_turn = c[0]
			c = c[1:]
	return solve(a,b,c, next_turn)
a=input().strip()
b=input().strip()
c=input().strip()
print(solve(a,b,c,"a"))
a = [int(input()) for i in range(3)]
if a[0] == 2:
	print("Hello World")
else:
	print(a[1]+a[2])

### FIXED CODE ###

a = int(input())
if a == 1:
  print("Hello World")
else:
  b = int(input())
  c = int(input())
  print(b + c)
l = list(map(int, input().split()))
x=l[0]*l[1]
if l[0]==1 or l[1]=1:
    print('1')
elif x%2==0:
    print(int(x/2))
else:
    print(int(x//2))

### FIXED CODE ###

l = list(map(int, input().split()))
x=l[0]*l[1]
if l[0]==1 or l[1]==1:
    print('1')
elif x%2==0:
    print(int(x/2))
else:
    print(int(x//2)+1)
N = int(input())
rest = {}
cities = []
for i in range(N):
    k,s = input().split()
    if k not in rest:
        rest[k] = []
        cities.append(k)
    rest[k].append([int(s),i+1])
print(sorted(rest))
cities.sort()
for k in cities:
    rest[k].sort(reverse = True)
    for i in rest[k]:
        print(i[1])

### FIXED CODE ###

a, b = map(int, input().split()) 
print((3*a + b) // 2)
H A = [int(i) for i in input().split(' ')]
print(H // A + 1)

### FIXED CODE ###

H, A = [int(i) for i in input().split(' ')]
print(H // A + min(H % A, 1))
x, y = int(input())
print(x + y//2 )


### FIXED CODE ###

x, y = map(int, input().split())
print(x + y//2 )
import itertools
L,R=map(int,input().split())
if L%2019==0 or R%2019==0:
	ans=0
else:
	L%=2019
	R%=2019
	INF=10*9
	ans=INF
	for i in itertools.combinations(range(L,R+1),2):
		ans=min(ans,(i*j)%2019)
print(ans)

### FIXED CODE ###

L,R=map(int,input().split())
ans=2019
for i in range(L,R):
	for j in range(i+1, R+1):
		if j%2019==0:
			print(0)
			exit()
		ans=min(ans,(i*j)%2019)
print(ans)
a, b, c, d, e, f = [int(x) for x in input().strip().split()]
a *= 100
b *= 100
if f < a + c:
    print("0 0")
    raise SystemExit

water_cands = set()
t = 0
while t <= f:
    water_cands.add(t)
    u = t + b
    while u <= f:
        water_cands.add(u)
        u += b
    t += a

rat, wat, sug = 0.0, 0, 0
for w in water_cands:
    suger_limit = min(f - w, w // 100 * e)
    suger_max = 0
    t = 0
    while t <= suger_limit:
        if suger_max < t:
            suger_max = t
        u = t + d
        while u <= suger_limit:
            if suger_max < u:
                suger_max = u
            u += d
        t += c
    if suger_max / (suger_max + w) > rat:
        rat = suger_max / (suger_max + w)
        wat = w
        sug = suger_max

print(wat + sug, sug)


### FIXED CODE ###

a, b, c, d, e, f = [int(x) for x in input().strip().split()]
a *= 100
b *= 100

water_cands = set()
t = 0
while t <= f:
    water_cands.add(t)
    u = t + b
    while u <= f:
        water_cands.add(u)
        u += b
    t += a

rat, wat, sug = 0.0, a, 0
for w in water_cands:
    if w == 0:
        continue
    suger_limit = min(f - w, w // 100 * e)
    suger_max = 0
    t = 0
    while t <= suger_limit:
        if suger_max < t:
            suger_max = t
        u = t + d
        while u <= suger_limit:
            if suger_max < u:
                suger_max = u
            u += d
        t += c
    if suger_max / (suger_max + w) > rat:
        rat = suger_max / (suger_max + w)
        wat = w
        sug = suger_max

print(wat + sug, sug)
while True:
    n=int(input())
    if n==0:break
    m=int(input())
    rel=sorted([[int(s)for s in input().split(" ")]for i in range(m)],key=lambda x:x[0])
    isf=[False for i in range(n)]
    inv=[False for i in range(n)]
    isf[0]=True
    for r in rel:
        if r[0]==1:
            isf[r[1]]=True
            inv[r[1]]=True
        elif isf[r[0]]==True:inv[r[1]]=True
    print(inv.count(True))

### FIXED CODE ###

while True:
    n=int(input())
    if n==0:break
    m=int(input())
    rel=sorted([[int(s)for s in input().split(" ")]for i in range(m)],key=lambda x:x[0])
    isf=[False for i in range(n)]
    inv=[False for i in range(n)]
    isf[0]=True
    for r in rel:
        if r[0]==1:isf[r[1]-1]=True
    for r in rel:
        if isf[r[0]-1]==True:inv[r[1]-1]=True
        elif isf[r[1]-1]==True:inv[r[0]-1]=True
    print(inv.count(True))
N = int(input())
T = []
for i in range(N):
    T.append(int(input()))
T.sort()
ans = 1
def gcd(m,n):
    x = max(m,n)
    y = min(m,n)
    if x%y == 0:
        return y
    else:
        while x%y!=0:
            z = x%y
            x = y
            y = z
        else:
            return z    
def lcm(m,n):
    return int(m * n/gcd(m,n))

for j in range(N):
    ans = lcm(ans,T[j])
        
print(ans)

### FIXED CODE ###

from functools import reduce
N = int(input())
T = []
for i in range(N):
    T.append(int(input()))

def gcd(m,n):
    if n == 0:
        return m
    return gcd(n,m%n)
    
def lcm(m,n):
    return m * n//gcd(m,n)

print(reduce(lcm,T))
import sys

n=int(sys.stdin.readline())
M=[]
for _ in range(n):
    M.append(sys.stdin.readline())

cnt = 0
for i in range(n):
    tmp = 0
    if M[0][i] != M[1][i]:
        tmp = tmp + 1
    if M[0][i] != M[2][i]:
        tmp = tmp + 1
    if M[1][i] == M[2][i] and tmp == 2:
        tmp = tmp - 1
    cnt = cnt + tmp
print(cnt)

### FIXED CODE ###

import sys

n=int(sys.stdin.readline())
a=sys.stdin.readline()
b=sys.stdin.readline()
c=sys.stdin.readline()


cnt = 0
for i in range(n):
    if a[i] == b[i] == c[i]:
        continue
    elif a[i] == b[i] or b[i] == c[i] or c[i] == a[i]:
        cnt = cnt + 1
    else:
        cnt = cnt + 2
print(cnt)
a, b, c = map(int, input().sprit())
print('{} {} {}'.format(c, a, b))

### FIXED CODE ###

a, b, c = map(int, input().split())
print('{} {} {}'.format(c, a, b))
k, x = input().split(' ')
k, x = int(k), int(x)   
arr = []
     
for i in range(k): 
 arr.append(x-i)
 arr.append(x+i)
arr = list(set(arr))
arr.sort()
text = ""
for i in range(len(arr) - 1):
  text += arr[i] + " "
print(text + arr[len(arr) - 1])

### FIXED CODE ###

k, x = input().split(' ')
k, x = int(k), int(x)   
arr = []
         
for i in range(k): 
  arr.append(x-i)
  arr.append(x+i)
arr = list(set(arr))
arr.sort()
text = ""
for i in range(len(arr) - 1):
  text += str(arr[i]) + " "
print(text + str(arr[len(arr) - 1]))
S = input()

counts = []
count = 0
for i in range(len(S)):
    if S[i] == 'A' or S[i] == 'C' or S[i] == 'G' or S[i] == 'T':
        count += 1
        continue
    else:
        counts.append(count)
        count = 0

print(max(counts))


### FIXED CODE ###

S = input()

counts = []
count = 0
for i in range(len(S)):
    if S[i] == 'A' or S[i] == 'C' or S[i] == 'G' or S[i] == 'T':
        count += 1
        if i == len(S) - 1:
            counts.append(count)
    else:
        counts.append(count)
        count = 0

print(max(counts))
#coding:UTF-8
def chain(p,n):
    m={}
    for i in range(1,n+1):
        m[i] = {i:0}
         
    for l in range(2,n+1):
        for i in range(1,n-l+2):
            j = i + l -1
            m[i][j] = float("inf")
            for k in range(i,j):
                m[i][j] = min(m[i][j],m[i][k]+m[k+1][j] + p[i-1]*p[k]*p[j])
    print(m[1][n])
    
def __name__=="__main__": 
    p={}
    n = int(input())
    for i in range(1,n+1):
        st = input()
        w = st.split()
        p[i-1] = int(w[0])
        p[i]   = int(w[1])
    chain(p,n)

### FIXED CODE ###

#coding:UTF-8
def chain(p,n):
    m={}
    for i in range(1,n+1):
        m[i] = {i:0}
         
    for l in range(2,n+1):
        for i in range(1,n-l+2):
            j = i + l -1
            m[i][j] = float("inf")
            for k in range(i,j):
                m[i][j] = min(m[i][j],m[i][k]+m[k+1][j] + p[i-1]*p[k]*p[j])
    print(m[1][n])
    
if __name__=="__main__": 
    p={}
    n = int(input())
    for i in range(1,n+1):
        st = input()
        w = st.split()
        p[i-1] = int(w[0])
        p[i]   = int(w[1])
    chain(p,n)
def resolve():
s = input()

f = True

if s[0] != "A":
    f = False

ss = s[1:2] + s[3:-2] + s[-1:]
for i in range(len(ss)):
    if ss[i] < "a" or ss[i] > "z":
        f = False

if (s[2] == "C" and s[-2] == "C"):
    f = False
if (s[2] != "C" and s[-2] != "C"):
    f = False

if f:
    print("AC")
else:
    print("WA")


### FIXED CODE ###

s  = input()
f = True
if s[0] != "A":
    f = False
c = 0
for i in range(2, len(s) - 1):
    if s[i] == "C":
        c += 1
if c != 1:
    f=False
ss = s[1:].replace("C", "")
for i in range(len(ss)):
    if ss[i] < "a" or ss[i] > "z":
        f = False
if f:
    print("AC")
else:
    print("WA")
# -*- coding: utf-8 -*-
n = int(input())
s = list(input())

result = 0
for(int i = 0; i < n - 3; i++):
  if (s[i] == 'A' and s[i+1] == 'B' and s[i+2] == 'C'):
    result = result + 1
    
print(result)

### FIXED CODE ###

n = int(input())
s = list(input())

result = 0
for i in range(len(s)):
    if (i > n - 3):
        break
    if (s[i] == 'A' and s[i+1] == 'B' and s[i+2] == 'C'):
        result = result + 1

print(result)
def gcd(*A):
    if len(A) == 2:
        a, b = A
        tmp = a % b
        while tmp != 0:
            a, b = b, tmp
            tmp = a % b
        return b
    else:
        return gcd(gcd(*A[:2]), *A[2:])

N = int(input())
A = list(map(int, input().split()))
print(max(gcd(*(A[j] for j in range(N) if i != j)) for i in range(N)))

### FIXED CODE ###

def gcd(a, b):
    tmp = a % b
    while tmp != 0:
        a, b = b, tmp
        tmp = a % b
    return b

N = int(input())
A = list(map(int, input().split()))

L = [0 for _ in range(N)]
R = [0 for _ in range(N)]

L[0], R[N - 1] = A[0], A[N - 1]

for i in range(N-1): # i=0,1,...N-2
    L[i + 1] = gcd(L[i], A[i + 1])
    R[N - i - 2] = gcd(R[N - i - 1], A[N - i - 2])

print(max(L[N-2], R[1], *(gcd(L[i], R[i+2]) for i in range(N-2))))
n,k = map(int,input().split())
a = list(map(int,input().split()))
cost = [0] * n
cost[1] = abs(a[1]-a[0])
mi = 999999
for i in range(1,n):
    for j in range(max(0,i-k),i):
        #print(j,mi)
        mi = min(mi,cost[j]+abs(a[i]-a[j]))
    cost[i] = mi
    mi = 999999
#print(cost)
print(cost[n])

### FIXED CODE ###

import sys
n,k = map(int,input().split())
a = list(map(int,input().split()))
cost = [0] * n
cost[1] = abs(a[1]-a[0])
mi = sys.maxsize
for i in range(1,n):
    for j in range(max(0,i-k),i):
        mi = min(mi,cost[j]+abs(a[i]-a[j]))
        #print(j,mi)
    
    cost[i] = mi
    mi = sys.maxsize
#print(cost)
print(cost[n-1])
x=input()
if x==0:
  print(1)
else if x==1:
  print(0)

### FIXED CODE ###

x=int(input())
if x==0:
  print(1)
else:
  print(0)
n, k = map(int,input().split())
inputarray = []
for i in range(n):
    inputarray.append([int(i) for i in input().split()])
t = [i[0] for i in inputarray]
d = [i[1] for i in inputarray]
print(n,k)
print(t)
print(d)
def combinationListRecursive(data, r):
  if r == 0 or r > len(data):
    return []

  result = []
  _combinationListRecursive(data, r, 0, [], result)
  return result


def _combinationListRecursive(data, r, start, progress, result):
  if r == 0:
    result.append(progress)
    return

  for i in range(start, len(data)):
    _combinationListRecursive(data, r - 1, i + 1, progress + [data[i]], result)

result = combinationListRecursive(range(len(d)), k)
best = 0
for i in result:
    tarray = []
    dtmp = 0
    for k in range(k):
        dtmp += d[i[k]]
        tarray.append(t[i[k]])
    tlist = list(set(tarray))
    ttmp = len(tlist) ** 2
    if best < dtmp + ttmp:
        best = dtmp + ttmp
print(best)

### FIXED CODE ###

from heapq import heappush, heappop
N, K = map(int, input().split())
TD = [list(map(int, input().split())) for _ in range(N)]
TD.sort(key=lambda x:x[1], reverse=True)
muptiple = set()
hp = []
for t, d in TD:
    flg = 0
    if t not in muptiple:
        muptiple.add(t)
        flg = 1
    heappush(hp, (d*-1, flg))

ret = []
point = 0
vari = 0
total = 0
for i in range(K):
    v = heappop(hp)
    t = v[0]*-1
    vari += v[1]
    point += t
    if not v[1]:
        heappush(ret, t)

total = vari ** 2 + point

while len(hp) > 0 and len(ret) > 0:
    v = heappop(hp)
    if v[1] == 0:
        continue
    pre_t = heappop(ret)
    t = v[0]*-1
    point -= pre_t - t
    vari += 1
    tmp = vari ** 2 + point
    total = max(total, tmp)

print(total)
N = int(input())
A = list(map (int, input().split()))
if 0 in A:
  print(0)
  return
 
re = 1
for i in range(N):
    re *= A[i]
    if re >= pow(10,18):
        print(-1)
        return
else:
    print(re)
    return
    

### FIXED CODE ###

a,b = map(int,input(). split())
print(a*b)
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def main():
  MOD = 10**9+7
  N = int(input())
  edge = [[] for _ in range(N+1)]
  dp = [[0]*2 for i in range(100005)]
  # dp[v][c]: 頂点vを色cの根とする部分木の塗り分け方の総数
  # 葉が決まると順々に求まっていく
  for i in range(N-1):
      x,y = map(int,input().split())
      edge[x].append(y)
      edge[y].append(x)

  # 0:white,1:black
  def dfs(v,last=-1):
      dp[v][0] = 1
      dp[v][1] = 1
      for nv in edge[v]:
          if nv == last:
              continue
          dfs(nv, v)
          dp[v][0] = dp[v][0] * ((dp[nv][0] + dp[nv][1]) % MOD) % MOD
          dp[v][1] = dp[v][1] * dp[nv][0] % MOD


  dfs(1)
  print((dp[1][0] + dp[1][1])%MOD)
if __name__ == ''__main__:
  main()

### FIXED CODE ###

import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def main():
  MOD = 10**9+7
  N = int(input())
  edge = [[] for _ in range(N+1)]
  dp = [[0]*2 for i in range(100005)]
  # dp[v][c]: 頂点vを色cの根とする部分木の塗り分け方の総数
  # 葉が決まると順々に求まっていく
  for i in range(N-1):
      x,y = map(int,input().split())
      edge[x].append(y)
      edge[y].append(x)

  # 0:white,1:black
  def dfs(v,last=-1):
      dp[v][0] = 1
      dp[v][1] = 1
      for nv in edge[v]:
          if nv == last:
              continue
          dfs(nv, v)
          dp[v][0] = dp[v][0] * ((dp[nv][0] + dp[nv][1]) % MOD) % MOD
          dp[v][1] = dp[v][1] * dp[nv][0] % MOD


  dfs(1)
  print((dp[1][0] + dp[1][1])%MOD)
if __name__ == '__main__':
  main()
import heapq

def solve(N, ABs):
    # print(N, ",", ABs)
    K = 10 ** 9
    taken = {i: False for i in range(N)}
    As = [(K - ab[0], K - ab[1], i) for i, ab in enumerate(ABs)]
    Bs = [(K - ab[1], K - ab[0], i) for i, ab in enumerate(ABs)]
    heapq.heapify(As)
    heapq.heapify(Bs)
    ans = 0
    taken_count = 0
    while True:
        if taken_count >= N:
            break
        if not len(As):
            break
        am = heapq.heappop(As)
        while taken[am[2]]:
            am = heapq.heappop(As)

        if not len(Bs):
            ans += (K - am[0])
            break

        bm = heapq.heappop(Bs)
        while taken[bm[2]]:
            bm = heapq.heappop(Bs)
        if am[2] == bm[2]:
            ans += (K - am[0])
            taken[am[2]] = True
            taken_count += 1
            if taken_count < N:
                bm = heapq.heappop(Bs)
                while taken[bm[2]]:
                    bm = heapq.heappop(Bs)
                ans -= (K - bm[0])
                taken[bm[2]] = True
                taken_count += 1
        elif am[0] < bm[0]:
            ans += (K - am[0])
            ans -= (K - bm[0])
            taken[am[2]] = True
            taken[bm[2]] = True
            taken_count += 2
        elif am[0] > bm[0]:
            ans += (K - bm[0])
            ans -= (K - am[0])
            taken[am[2]] = True
            taken[bm[2]] = True
            taken_count += 2

    return ans

if __name__ == "__main__":
    N = int(input())
    ABs = [tuple(map(int, input().split(" "))) for _ in range(N)]
    print(solve(N, ABs))


### FIXED CODE ###

def cheat_solve(N, ABs):
    Ds = sorted([ab[0] + ab[1] for ab in ABs], reverse=True)
    bsum = sum([ab[1] for ab in ABs])
    dsum = sum(Ds[::2])
    return dsum - bsum

if __name__ == "__main__":
    N = int(input())
    ABs = [tuple(map(int, input().split(" "))) for _ in range(N)]
    print(cheat_solve(N, ABs))
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
from math import cos,sin,tan
import cmath as cma
import copy as cp
import sys
import re
def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def barr(n): return [False for _ in range(n)]
def adj(n): return [[] for _ in range(n)]
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7; EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf

a,b = imap()
b *= 100
ans = a*b //100
print(ans)


### FIXED CODE ###

import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
import cmath as cma
import copy as cp
import sys
def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def barr(n): return [False for _ in range(n)]
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7; EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf

import decimal as dec

a,b = sarr()
a,b = dec.Decimal(a), dec.Decimal(b)
ans = int(a*b)
print(ans)
s=input().split(" ")
a,b,c,d=int(s[0]),int(s[1]),int(s[2]),int(s[3])
if min(c,d)>=a and min(c,d)<=b and min(a,b)>=c and min(a,b)<=d:
  print("Yes")
else:
  print("No")


### FIXED CODE ###

n=int(input())
print("ACL"*n)
n,m=map(int,input().split())
A = list(map(int,input().split()))
s=sum(A)
c=0
for a in A:
    if a >= s/(4*m):
        c=c+1

if c>=m:
     print('Yes')
else:
    print("No")

### FIXED CODE ###

x,y,z=map(int,input().split())
print("{} {} {}".format(z,x,y))