peterverebics/CodeNet_Python_118 huggingface dataset:
from math import floor, ceil
[A, B] = list(map(int, input().split()))

def main(A, B):
    
    underN = min(int(A // 0.08), int(B // 0.1))
    upperN = max(int(ceil(A / 0.08)), int(ceil(B / 0.1)))

    for i in range(underN, upperN+1):

        if int(floor(i*0.08)) == A and int(floor(i*0.1)) == B:
            return i
    
    else: return -1
    

if __name__ == "__main__":

    answer = main(A, B)
    print(answer)
A, B = map(int, input().split())
for i in range(1, 1003):
    if int(i*0.08) == A and int(i*0.1) == B:
        print(i)
        exit()
print(-1)
A, B = map(int,input().split())
for k in range(1,20000):
    if int(k*1.08) == A+k and int(k*1.10) == B+k:
        print(k)
        exit(0)
print(-1)
A,B=map(int, input().split())
ans=-1
for i in range(1,10001):
	if int(i*0.08)==A and int(i*0.1)==B:
		ans=i
		break
print(ans)
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
mod=pow(10,9)+7

a,b=map(int,input().split())

for i in range(100000):
    tmp=int(i*0.08)
    tmp2=int(i*0.1)
    if a==tmp and b==tmp2:
        print(i)
        break
else:
    print(-1)
a, b = map(int, input().split())
exist = False
for i in range(1001):
    eight = int(i * 0.08)
    ten = int(i * 0.1)
    if eight == a and ten == b:
        print(i)
        exist = True
        break
if not exist:
    print('-1')
A,B=map(int,input().split(' '))
for i in range(1,1001):
    if i*0.08//1==A and i*0.1//1==B:
        print(i)
        exit()
print(-1)
import math
import sys
input = sys.stdin.readline

A, B = map(int, input().split())

for i in range(1, 10010):
    if math.floor(i * 0.08) == A and math.floor(i * 0.1) == B:
        print(i)
        exit(0)

print(-1)
a, b = map(int, input().split())
for i in range(1010):
    tax8 = int(i * 0.08)
    tax10 = int(i * 0.1)

    if a == tax8 and b == tax10:
        print(i)
        exit()

print(-1)
import math

a,b =map(int,input().split())
# mは原価
m = math.ceil(a*(100/8))
while int(m*(8/100)) == a:
    if int(m*0.1) == b:
        print(m)
        break
    else:
        m += 1
else:
    print(-1)
a,b = map(int,input().split())
for i in range(1,1100):
    if int(i*0.08) == a:
        if int(i*0.1) == b:
            print(i)
            exit()
print("-1")
a,b=input().strip().split(" ")
a,b=[int(a),int(b)]
k=0
for i in range(1200):
    aa=(i*8)//100
    bb=(i*10)//100
    if (a==aa and b==bb):
        print(i)
        k=1
        break
if k==0:
    print(-1)
import sys

A, B = map(int, input().split())

for p in range(1, int(2e3)):
    _A, _B = int(p*8e-2), int(p*1e-1)
    if _A == A and _B == B:
        print(p)
        sys.exit()

print('-1')
a,b=map(int,input().split())

for i in range(0,2000):
	if int(i*0.08)==a and int(i*0.1)==b:
		print(i)
		exit()

print(-1)
a,b=map(int,input().split())
for i in range(10**6):
    if i*8//100==a and i//10==b:
        print(i)
        exit()
print(-1)
A, B = map(int, input().split())
a = int(A // 0.08)
ans_lst = []
for i in range(20):
    # print(a, int(a * 0.08) == A)
    if int(a * 0.08) == A:
        ans_lst.append(a)
    a += 1
for i in ans_lst:
    if int(i * 0.1) == B:
        print(i)
        break
else:
    print(-1)
import math
A,B=list(map(int,input().split()))
ans=-1
start=math.ceil(B*(10))
cntr=start
end=math.ceil((B+1)*(10))
while(cntr<end):
    if(math.floor(cntr*0.08)==A):
        ans=cntr
        break
    else:
        cntr+=1
print(ans)
A, B = map(int, input().split())
for i in range(1000 * max(A, B)):
    if int(i * 0.08) == A and int(i * 0.1) == B:
        print(i)
        exit()
print(-1)
a,b = map(int, input().split())
for i in range(1111):
    if int(i*0.08)==a and int(i*0.1)==b:
        print(i)
        exit()
print(-1)
import sys
A,B = map(int,input().split())
for i in range(1,1251):
  C_8 = int(i*0.08)
  C_10 = int(i*0.1)
  if C_8 == A and C_10 == B:
    print(i)
    sys.exit()

print(-1)
a,b=map(int,input().split())

for i in range(1,10001):
    if (i*0.08)//1==a and (i*0.1)//1==b:
        print(i)
        exit()
print(-1)
a,b = map(int,input().split())
for i in range(1, 1001):
  if int(i * 0.08) == a and int(i * 0.1) == b:
    print(i)
    break
else:
  print('-1')
a,b=map(int,input().split())
num=1
while 1:
    if int(num*0.08)==a and int(num*0.1)==b:
        print(num)
        break
    if int(num*0.08)>a and int(num*0.1)>b:
        print(-1)
        break
    num+=1
import sys
import math

A,B = map(int,input().split())

for i in range(1,10001):
  if math.floor(i * 0.08) == A and math.floor(i * 0.1) == B:
    print(i)
    sys.exit()
    
print('-1')
import math
A,B=map(int,input().split())

for i in range(1,2000):
    if math.floor(i*0.08)==A and math.floor(i*0.1)==B:
        print(i)
        break
    elif i==1999:
        print(-1)
a,b=map(int,input().split())

st=.08
lt=.1
s=[]
l=[]

for i in range(1262):
    if a/st<=i<(a+1)/st:
        s.append(i)

for i in range(1262):
    if b/lt<=i<(b+1)/lt:
        l.append(i)

t=[]

for i in s:
    if i in l:
        t.append(i)

if not t:
    print('-1')
else:
    print(min(t))
from math import floor
a, b = map(int, input().split())

a_ = a // 0.08
b_ = b // 0.1

ans = min(floor(a_), floor(b_))

while floor(ans * 0.08) != a or floor(ans * 0.1) != b:
    ans += 1
    if floor(ans * 0.08) > a or floor(ans * 0.1) > b:
        print('-1')
        exit()
print(ans)
A,B = map(int,input().split())
ak = []
bk = []
for k in range(-int((-A/0.08)//1),-int(-(A/0.08+12.5)//1)):
  ak.append(k)
for k in range(-int((-B/0.10)//1),-int(-(B/0.10+10.0)//1)):
  bk.append(k)
ans = min(set(ak) & set(bk)) if len(set(ak) & set(bk)) > 0 else -1
print(ans)
a, b = map(int, input().split())

x = 1
while x <= 1100:
    if (x*8//100) == a and (x//10) == b:
        print(x)
        break
    x += 1
else:
    print(-1)
N,M=map(int,input().split())

x=max(N//0.08+1,M//0.1+1)
y=min((N+1)//0.08, (M+1)//0.1)
print( -1 if y<x else int(x))
a, b = map(int, input().split())
import math
num = -1

for i in range(100000):
    if a == math.floor(i*0.08):
        if b == math.floor(i*0.1):
            num = i
            break
print(int(num))
A,B = map(int,input().split())


def solve():
    for i in range(100*100):
        if( int(i * 0.08) == A and int(i*0.1)==B ):
            return i
    return -1
print(solve())
# coding: utf-8
# Your code here!

import math

A, B = map(int, input().split())
num = 0

for i in range(1251):
    num += 1
    if math.floor(num * 0.08) == A:
        if math.floor(num * 0.1) == B:
            print(num)
            exit()
else:
    print(-1)
import math

A,B=map(int,input().split())
ans=-1
cnt=math.floor(A/0.08)
for i in range(cnt,1001):
  X8=math.floor(i*0.08)
  X10=math.floor(i*0.1)
  if X8 == A and X10 == B :
    ans=i
    break
print(ans)
A,B=map(int,input().split())

i=0
while True:
    if int(i*0.08)==A and int(i*0.1)==B:
        print(i)
        break
    elif i > A/0.08 and i > B/0.1:
        print(-1)
        break
    i += 1
#!/usr/bin/env python3

import math

A, B = map(int, input().split())

for i in range(1, 1010):
    if math.floor(i * 0.08) == A and math.floor(i * 0.1) == B:
        print(i)
        exit()
print(-1)
A, B = map(int, input().split())
import math
N = math.ceil(A / 0.08)
n = math.ceil(B / 0.1)
M = max(N, n)
m = min(N, n)
ans = -1
for i in range(m, M+1):
  if int(i*0.08) == A and int(i*0.1) == B:
    ans = i
    break
print(ans)
import math

a, b = map(int, input().split())

min = int(math.ceil(a / 0.08))
max = min
while math.floor(max * 0.08) == a:
    max += 1

for i in range(min, max):
    if math.floor(i * 0.1) == b:
        print(i)
        break
else:
    print(-1)
a, b = map(int, input().split())
ans = -1
for i in range(100000):
    if int(i*0.08) == a and int(i*0.1) ==b:
        ans = i
        break
print(ans)
a, b = map(int, input().split())
for i in range(1, 1010):
	if int(i * 0.08) == a and int(i * 0.1) == b:
		print(i)
		break
else:
	print(-1)
a,b = map(int,input().split())

res = -1

for i in range(1,3500):
    judge = True

    p = (i*8) // 100
    q = (i*10) // 100
    if a == p and b == q:
        res = i
        break


print(res)
a,b = map(int,input().split())
import math
import sys
for i in range(1,2000):
    if math.floor(i*0.08) == a and math.floor(i*0.1) == b:
        print(i)
        sys.exit()

print('-1')
a,b=map(int,input().split())
la,ra=12.5*a,12.5*a+12.5
lb,rb=10*b,10*b+10
for i in range(lb,rb):
  if la<=i<ra:
    print(i)
    exit(0)
print(-1)
A, B = map(int, input().split())
#print((A + 1) / 0.08)
ans = -1
for i in range(int(B / 0.1), int((A + 1) / 0.08)):
  if int(i * 0.08) == A and int(i * 0.1) == B:
    ans = i
    break
print(ans)
a,b=map(int,input().split())
ans=0
flag=False
for i in range(b*10,(b+1)*10):
    x=i*8
    if 100*(a+1)>x>=100*a:
        flag=True
        ans=i
        break
print(ans if flag else -1)
import math

A,B=(int(x) for x in input().split())
#N=int(input())
#A=list(map(int, input().split()))

a_1=math.ceil(A*12.5)
a_2=math.ceil((A+1)*12.5)
la=list(range(a_1,a_2))

b_1=int(format(B*10 ,'.0f'))
b_2=int(format((B+1)*10 ,'.0f'))
lb=list(range(b_1,b_2))

la_lb_and_list = list(set(la) & set(lb))

if len(la_lb_and_list) == 0:
    print('-1')
else :
    print(min(la_lb_and_list))
A, B = map(int, input().split())
result = True
for a in range(1, 1001):
    if int(a * 0.08) == A and int(a * 0.1) == B:
        print(a)
        break
        result = False
        exit()
        
if result:
    print(-1)
A, B = map(int, input().split())

x1 = 25*A//2
x2 = 25*(A+1)//2
x3 = 10*B
x4 = 10*(B+1)

if x1 <= x3 and x3 < x2:
  print(x3)
elif x3 <= x1 and x1 < x4:
  print(x1)
else:
  print(-1)
a, b = map(int,input().split())

p1 = int(a // 0.08 + 1)
p2 = int(b // 0.1 + 1)

p1_list = [i for i in range(p1,p1+13)]
p2_list = [i for i in range(p2,p2+10)]

p_list = set(p1_list) & set(p2_list)

p_list = list(p_list)
p_list = sorted(p_list)

if len(p_list) == 0:
    print(-1)
else:
    print(p_list[0])
ret = -1

A, B = [int(i) for i in input().split()]

for i in range(2000):
    if int(i*0.08) == A and int(i * 0.1) == B:
        ret = i
        break

print(i)
a , b = map(int, input().split())
for i in range(1 , 10100) :
  a1 = int(i*0.08)
  b1 = int(i*0.10)
  if a1 == a and b1 == b :
    print(i)
  else :
    print(-1)
import math

a,b=map(int,input().split())
if a%2==0:
    s=a*12.5
    s=math.floor(s)
    if s-b*10==5:
        print(s)
    elif b*10-s==5:
        print(b*10)
    elif b*10==s:
        print(s)
    else:
        print(-1)
else:
    t=a*12.5 +0.5
    if t-b*10==3:
        t=math.floor(t)
        print(t)

    elif b*10-t==7:
        print(b*10)
    else:
        print(-1)
A, B = map(int,input().split())

a = int(A / 0.08)

if A == int(a * 0.08) and B == int(a * 0.10) :
    print(a)
else :
    print('-1')
A, B = map(int, input().split())
Ax = A * 25 / 2
Ay = (A + 1) * 25 / 2
Bx = B * 10
By = (B + 1) * 10

if Ay <= Bx or By <= Ax:
    print(-1)
else:
    ans = max(Bx, Ax)
    if ans % 1:
        ans = int(ans)
        ans += 1
    print(ans)
A, B = map(int, input().split())

A = 100 * A
B = 100 * B

a = 0
b = 0

for i in range(A, A+100):
    
    a = i / 8
    
    for j in range(B, B+100):
        
        b = j /10
        
        if a == b:
            
            print(int(a))
            break
    else:
        if i == A +99:
            print("-1")
        else:
            continue
    
    break
import math
a, b = map(int, input().split())
for i in range(1, 101):
  aa = math.floor(i*1.08)
  bb = math.floor(i*1.1)
  if aa - i == a and bb - i == b:
    print(i)
    exit()
print(-1)
import math
A, B = list(map(int, input().split()))

amax = math.ceil((A + 1) / 8 * 100) - 1
amin = math.ceil(A / 8 * 100)
bmax = math.ceil((B + 1) * 10) - 1
bmin = math.ceil(B / 10 * 10)

if amin > bmax or bmin > amax:
    print(-1)
else:
    print(int(max(amin, bmin)))
A,B = map(int,input().split())

a=-(-A//0.08)
b=-(-B//0.1)
c=-(-(A-1)//0.08)
d=-(-(A+1)//0.08)

if a==b or c < b < d:
    print(int(a))
else:
    print(-1)
a, b = map(int, input().split())

# for i in range(1, 1010):
#     if a == int(i*0.08) and b == int(i*0.1):
#         print(i)
#         break
# else:
#     print(-1)

# O(1)の回答
if int(b*10*0.08) > a:
    print(-1)
elif int((b*10+9)*0.08) < a:
    print(-1)
elif a % 2 == 0:
    print(int(a/0.08))
else:
    print(int(a/0.08)+1)
A, B = map(int, input().split())
for i in range(1000):
    if int(i*0.08)==A and int(i*0.1)==B:
        print(i)
        exit()
print(-1)
'''input
8 10
'''
import math

a, b = input().split()
a = int(a)
b = int(b)

a_low = math.ceil((a + 0) * 12.5)
a_hig = math.floor((a + 1) * 12.5)

b_low = math.ceil((b + 0) * 10)
b_hig = math.floor((b + 1) * 10)

if b_low <= a_low and a_low <= b_hig:
    print(a_low)
    exit()

if a_low <= b_low and b_low <= a_hig:
    print(b_low)
    exit()

print(-1)
import math

A, B = map(int, input().split())

X = A / 0.08
Y = B / 0.1

if X > Y:
    Z = X * 0.2

    if Y + Z == X:
        print(X)
    else:
        print(-1)
else: 
    Z = Y * 0.2
    
    if X + Z == Y:
        print(Y)
    else:
        print(-1)
import math
a, b = map(int, input().split())
if(math.ceil(a/0.08) < math.ceil(b/0.1)):
    print(-1)
else:
    print(math.ceil(a/0.08))
a, b = map(int, input().split())

a_min = -(-a*100//8)
a_max = int((a+1)*100/8)
b_min = -(-b*100//10)
b_max = int((b+1)*100/10)

if a_max >= b_min and b_max >= a_min:
    print(max([a_min, b_min]))
else:
    print(-1)
a,b = input().split()
a = int(a)
b = int(b)
c = 0
for i in range(10000):
    d = c*0.08
    e = c*0.1
    d = int(d)
    e = int(e)
    if d == a and e == b:
        print(c)
        break
    elif c == 10000:
        print('-1')
    else:
        c += 1
import math
A,B=map(int,input().split())
C=max(100*A/8,10*B)
D=min(100*(A+1)/8,10*(B+1))
if math.ceil(C)>math.floor(D):
    print("-1")
else:
    print(math.ceil(C))
# coding: utf-8

a, b = map(int, input().split())

a_target1 = a / 0.08
a_target2 = (a + 1) / 0.08

b_target1 = b / 0.1
b_target2 = (b + 1) / 0.1


result_list = []

for i in range(int(a_target1), int(a_target2)):
    if i >= b_target1 and i < b_target2:
        result_list.append(i)

if result_list == []:
    print(-1)
else:
    result = min(result_list)
    print(result)
a,b = map(int, input().split(" "))
a1 = a / 0.08
b1 = b / 0.1
if a1 == b1:
  print(int(a1))
else:
  print(-1)
# coding: utf-8
import math

def main():
    a, b = map(int, input().split())
    tmp_a_min = math.floor(a / 0.08)
    tmp_a_max = math.floor((a+1) / 0.08)
    # print(tmp_a_min, tmp_a_max)
    for i in range(tmp_a_min, tmp_a_max):
        if math.floor(i * 0.1) == b:
            print(i)
            break
    else:
        print(-1)
main()
import math
a,b=map(int,input().split())
arr=[]
for i in range(1,101,1):
  if a==math.floor(i*0.08) and b==math.floor(i*0.1) :
    print(i)
    exit()
print(-1)
import math
flag = 0
a,b = map(int,input().split())

for i in range(1000):
    if int(i*0.08) == a and int(i*0.1) == b:
        print(i)
        break
    elif i*0.08 > a and i*0.1 > b:
        print(-1)
        break
a,b=map(int,input().split())
k=[]
o=[]
p=[]
for i in range(1,101):
    if int(i*0.08)==a:
        k.append(i)
for j in range(1,101):
    if int(j*0.1)==b:
        o.append(j)
for t in range(len(k)):
    for u in range(len(o)):
        if k[t]==o[u]:
            p.append(k[t])
if p==[]:
    print(-1)
else:
    print(min(p))
a,b = [int(x) for x in input().split()]
amax = (a+1)*12.5
amin = a*12.5
bmax = int((b+1)*10)
bmin = int(b*10)
hantei = bmin
if amax <= bmin:
  hantei = str(-1)
elif bmax <= amin:
  hantei = str(-1)
elif bmin < amin:
  hantei = round(amin)
print(hantei)
from math import ceil
A, B = map(int, input().split(' '))
x0 = ceil(A / 0.08)
x1 = ceil((A+1) / 0.08)
y0 = ceil(B / 0.1)
y1 = ceil((B+1) / 0.1)
if x1 < y0:
  print(-1)
else:
  print(min(max(x0, y0), min(x1, y1)))
import math

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

rangeA = [A / 0.08, (A + 1) / 0.08]
rangeB = [B / 0.1, (B + 1) / 0.1]

if rangeA[0] <= rangeB[0]:
  if rangeB[0] <= rangeA[1]:
    print(math.ceil(rangeB[0]))
    exit(0)
else:  # rangeA[0] > rangeB[0]
  if rangeA[0] <= rangeB[1]:
    print(math.ceil(rangeA[0]))
    exit(0)
print(-1)
a,b=list(map(int,input().split()))

for i in range(1000):
    if int(i*0.08)==a and int(i*0.1)==b:
        print(i)
        break
    elif i==100:
        print(-1)
import math
A,B = list(map(int,input().split()))
def problem_gksn(A, B):
  x_min = A / (0.08)
  x_max = (A+1)/0.08
  y_min = B / (0.10)
  y_max = (B+1) / (0.10)
  # print(x_min,x_max,y_min,y_max)
  if max(x_min, y_min) <= min(x_max, y_max):
    return math.ceil(max(x_min, y_min))
  else:
    return -1
print(problem_gksn(A,B))
import math

a, b = map(int, input().split()) 

e=int(a / 0.08)

for i in range(e, 101):
    if (b == math.floor(e * 0.1)):
        print(i)
        exit (0)

print(-1)
A, B = map(int, input().split())
for i in range(1, 10000):
  if int(0.08 * i) == A and int(0.01 * i) == B:
    print(i)
    quit()
print('-1')
Z = list(map(int,input().split()))
c=[]
for i in range(1,101):
  c.append([i*0.08//1,i*0.1//1])

print(c.index(Z)+1 if Z in c else -1)
import math
a=input().split()
A,B=int(a[0]),int(a[1])
p=int(A/0.08)
if(math.floor(p*0.1)==B):
  print(p)
else:
  print(-1)
A,B=map(int,input().split())
sampleA=A*100/8
sampleB=B*10
sampleA=int(sampleA)
sampleB=int(sampleB)
ans=[]
for i in range(max(sampleA,sampleB),max(sampleA,sampleB)+10):
    if int(i*8/100)==A and int(i*0.1)==B:
        ans.append(i)
        break
    else:
        ans.append(-1)
print(min(ans))
a,b = map(int,input().split())

ans_min = min(int(a*12.5),int(b*10))
ans_max = max(int(a*12.5),int(b*10))

for i in range(ans_min,ans_max+1):
    if a == int(i*0.08) and b == int(i*0.1):
        print(i)
        exit()

print(-1)
a, b = map(int, input().split())

a_min = a * 100 / 8
a_max = (a + 1) * 100 / 8

b_min = b * 100 / 10
b_max = (b + 1) * 100 / 10

out = max(a_min, b_min)
print(int(out) if (out < a_max) & (out < b_max) else -1)
a,b=map(int,input().split())

import math
a_min=math.ceil(a/0.08)
a_max=math.floor((a+1)/0.08)
b_min=math.ceil(b/0.1)
b_max=math.floor((b+1)/0.1)

if a_max<b_min or b_max<a_min:
    ans=-1
else:
    ans=max(a_min,b_min)
print(ans)
import math

A, B = [int(i) for i in input().split()]
ans = []
for i in range(10):
    for j in range(10):
        A_float = A + 0.1 * i
        B_float = B + 0.1 * j

        x_a = math.floor(A_float / 0.08)
        x_b = math.floor(B_float / 0.1)
        
        if x_a == x_b:
            ans.append(x_a)
            
if len(ans) > 0:
    print(min(ans))
else:
    print(-1)
A, B = list(map(int, input().split()))

amax = (A + 1) / 8 * 100
amin = A / 8 * 100
bmax = (B + 1) / 10 * 100
bmin = B / 10 * 100

answer = amin if amin <= bmax and amin >= bmin else - 1

print(int(answer))
import sys
input = sys.stdin.readline
A, B = map(int, input().split())

xmin = 1
while xmin < 100*A:
    if int(0.08*xmin) == A and int(0.1*xmin) == B :
        print(int(xmin))
        exit()
    elif int(0.08*xmin) < A or int(0.1*xmin) < B :
        xmin += 1
    else :
        print(-1)
        exit()
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    A,B=map(int,input().split())
    for i in range(1,101):
        if int(i*0.08)==A and int(i*0.1):
            print(i)
            exit()
    print(-1)

if __name__ == '__main__':
    main()
A,B = map(int,input().split())
for i in range(101):
  if i*0.08//1 == A and i*0.1//1 == B:
    print(i)
    exit()
print(-1)
#ABC158
a,b = map(int,input().split())

tax_a = a/0.08

if int(tax_a*0.1) == b:
    ans = tax_a-1
    if int(ans*0.1) == b and int(ans*0.8) == a:
        print(int(ans))
    else:
        print(int(tax_a))
else:
    print('-1')
def main():
    a, b = map(int, input().split())
    
    tmp_8 = int(a / 0.08)
    tmp_10 = int(b / 0.1)

    check_10 = int(tmp_8*0.1)
    check_8 = int(tmp_10*0.1)

    if check_8 != check_10:
        print(-1)
    else:
        print(tmp_8)




if __name__ == '__main__':
    main()
a, b = input().split()
a, b = int(a), int(b)
# ans_a = (0.08) / a
# ans_b = (0.1) / b
ans_a = a / 0.08

# ans_b = b /0.1
ans_b = ans_a * 0.1

# print("a", ans_a)
# print("b", ans_b)

if b != int(ans_b):
    print("-1")
print(int(ans_a))
A,B = [int(x) for x in input().split()]
 
number1 = int(A*100//8)
number2 = int(B*100//10)
 
if number1//10 == B:
    if number2*8//100 == A:
        if number1 <= number2:
            print(number1)
        else:
            print(number2)
    else:
        print(number1)
else:
    if number2*8//100 == A:
        print(number2)
import math
N = list(map(int, input().split()))
X = [i for i in range(int(N[0]*(1/0.08)), math.ceil((N[0]+1)*(1/0.08)))]
Y = [i for i in range(int(N[1]*(1/0.10)), math.ceil((N[1]+1)*(1/0.10)))]
#print(X, Y)
cand = set(X) & set(Y)
if len(cand) == 0:
  print(-1)
else:
  print(min(cand))
import sys
def LI(): return list(map(int, sys.stdin.readline().split()))
a = LI()
i = 0.1
elist,blist= [],[]
for b in range(9):
  elist.append(int((a[0]+1-i)/0.08))
  blist.append(int((a[1]+1-i)/0.1))
  i += 0.1
elist.append(int(a[0]/0.08))
blist.append(int(a[1]/0.1))
blist.sort()
for b in blist:
  if b in elist:
    print(b)
    sys.exit()
print(-1)
A, B = map(int, input().split())

before = B * 10
not_found = True

for i in range(13):
  res = before + i
  tmp = int((before + i) * 0.08)
  if tmp == A:
    print(res)
    not_found = False
    break

if not_found:
  print(-1)
#output <= 1000

nums = [int(e) for e in input().split()]
for i in range(1,1001):
  if ((((i * 8) // 100) == nums[0]) & (((i * 10) // 100) == nums[1])):
    print(i)
  else:
    print(-1)
a,b = map(int,input().split())

min8 = a/8*100
max8 = (a+1)/8*100
min10 = b*10/1
max10 = (b+1)*10/1
ans = -1
for i in range(min(int(min8),int(min10)),max(int(max8),int(max10))+1):
    i = float(i)
    if min8 < i and max8 > i and min10 < i and max10 > i:
        ans =  int(i)
print(ans)
#デバッグ用
#print(ans/100*8,ans/100*10)
import math
A, B = map(float, input().split())
lowerA = math.ceil(A/0.08)
upperA = math.floor((A+1)/0.08)      
lowerB = math.ceil(B/0.1)
upperB = math.floor((B+1)/0.1)
answer = -1
for i in range(lowerA, upperA):
  if (lowerB <= i) and (i <= upperB):
    answer = i
    break
print(answer)
a, b = map(int, input().split())

xa = int(a/0.08)
xb = int(b/0.1)

if xa == xb:
    print(xa)
else:
    if int(xa*0.1) == b:
        print(xa)
    elif int(xb*0.08) == a:
        print(xb)
    else:
        print(-1)
import math

A, B = map(int, input().split())
r=100000

x = math.floor(A/0.08)
y = math.floor(B/0.1)

if(math.floor(x*0.1)!=B):
  print("-1")

else:
  while(y<x):
    if(math.floor(y*0.1)==math.floor(y*0.08)):
      if(y<r):
        r=y
    y+=1

  print(r)
a, b = map(int, input().split())
if a * 100 % 8 == 0:
    low = max(a * 100 // 8, b * 10)
else:
    low = max(a * 100 // 8 + 1, b * 10)
high = min(100 * (a + 1) // 8, 10 * (b+1))

if low <= high:
    print(low)
else:
    print(-1)
#!/usr/bin/env python3
import sys
import collections as cl
import math

def II(): return int(sys.stdin.readline())


def MI(): return map(int, sys.stdin.readline().split())


def LI(): return list(map(int, sys.stdin.readline().split()))


def main():
    A,B = MI()
    for i in range(101):
        if math.floor( i * 0.08 ) == A and math.floor(i * 0.1) == B:
            print(i)
            exit()

    print(-1)


main()
A, B = map(int, input().split())
for i in range(1, 101):
    if (i * 0.08) // 1 == A and (i * 0.1) // 1 == B:
        print(i)
        exit(0)

print(-1)
def tax8(n):
    return int(n*(1.08))
    
def tax10(n):
    return int(n*(1.1))

a , b = map(int,input().split())

ans = -1

x = []
for i in range(1,a+1):
    if tax8(i) == a:
        x.append(i)
        
y = []
for i in range(1,b+1):
    if tax10(i) == b:
        y.append(i)
        
for i in x:
    if i in y:
        ans = i
        break
    
print(ans)
a,b=map(int,input().split())
a1,b1=(100*a)//8,10*b
#print(a1,b1)
if a1//10==b and (b1*8)//100==a:
    print(min(a1,b1))
elif a1//10==b:
    print(a1)
elif (b1*8)//100==a:
    print(b1)
else:
    print(-1)
#print(max((100*a)//8,10*b))