Problem:
 Score : 100 points    Problem Statement There are two buttons, one of size A and one of size B .  When you press a button of size X , you get X coins and the size of that button decreases by 1 .  You will press a button twice. Here, you can press the same button twice, or press both buttons once.  At most how many coins can you get?      Constraints  All values in input are integers.  3 \leq A, B \leq 20         Input Input is given from Standard Input in the following format:  A  B       Output Print the maximum number of coins you can get.        Sample Input 1 5 3      Sample Output 1 9  You can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.       Sample Input 2 3 4      Sample Output 2 7       Sample Input 3 6 6      Sample Output 3 12

Solution (Python):



""" convenient functions




"""

import sys
sys.setrecursionlimit(10**7)
from itertools import accumulate, combinations, permutations, product 

from math import factorial, ceil, floor
def factorize(n):
    """return the factors of the Arg and count of each factor
    
    Args:
        n (long): number to be resolved into factors
    
    Returns:
        list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
    """
    fct = []  
    b, e = 2, 0  
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct
def combinations_count(n, r):
    """Return the number of selecting r pieces of items from n kinds of items.
    
    Args:
        n (long): number
        r (long): number
    
    Raises:
        Exception: not defined when n or r is negative
    
    Returns:
        long: number
    """
    
    if n < 0 or r < 0:
        raise Exception('combinations_count(n, r) not defined when n or r is negative')
    if n - r < r: r = n - r
    if r < 0: return 0
    if r == 0: return 1
    if r == 1: return n
    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]
    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot
    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])
    return result
def combinations_with_replacement_count(n, r):
    """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
    
    Args:
        n (long): number
        r (long): number
    
    Raises:
        Exception: not defined when n or r is negative
    
    Returns:
        long: number
    """
    if n < 0 or r < 0:
        raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
    elif n == 0:
        return 1
    else:
        return combinations_count(n + r - 1, r)
from bisect import bisect_left, bisect_right
from collections import deque, Counter, defaultdict 
from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
from copy import deepcopy, copy 
from operator import itemgetter


from functools import reduce
def chmin(x, y):
    """change minimum
    if x > y, x = y and return (x, True).
    convenient when solving problems of dp[i]
    
    Args:
        x (long): current minimum value
        y (long): potential minimum value
    
    Returns:
        (x, bool): (x, True) when updated, else (x, False)
    """
    if x > y:
        x = y
        return (x, True)
    else:
        return (x, False)
def chmax(x, y):
    """change maximum
    if x < y, x = y and return (x, True).
    convenient when solving problems of dp[i]
    
    Args:
        x (long): current maximum value
        y (long): potential maximum value
    
    Returns:
        (x, bool): (x, True) when updated, else (x, False)
    """
    if x < y:
        x = y
        return (x, True)
    else:
        return (x, False)

from fractions import gcd 
def gcds(numbers):
    return reduce(gcd, numbers)
def lcm(x, y):
    return (x * y) // gcd(x, y)
def lcms(numbers):
    return reduce(lcm, numbers, 1)



INF = 10 ** 18
MOD = 10 ** 9 + 7
modpow = lambda a, n, p = MOD: pow(a, n, p) 
def modinv(a, p = MOD):
    
    
    return modpow(a, p-2, p)
def modinv_list(n, p = MOD):
    if n <= 1:
        return [0,1][:n+1]
    else:
        inv_t = [0,1]
        for i in range(2, n+1):
            inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
        return inv_t
def modfactorial_list(n, p = MOD):
    if n == 0:
        return [1]
    else:
        l = [0] * (n+1)
        tmp = 1
        for i in range(1, n+1):
            tmp = tmp * i % p
            l[i] = tmp
        return l
def modcomb(n, k, fac_list = [], p = MOD):
    
    
    from math import factorial
    if n < 0 or k < 0 or n < k: return 0
    if n == 0 or k == 0: return 1
    if len(fac_list) <= n:
        a = factorial(n) % p
        b = factorial(k) % p
        c = factorial(n-k) % p
    else:
        a = fac_list[n]
        b = fac_list[k]
        c = fac_list[n-k]
    return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
def modadd(a, b, p = MOD):
    return (a + b) % MOD
def modsub(a, b, p = MOD):
    return (a - b) % p
def modmul(a, b, p = MOD):
    return ((a % p) * (b % p)) % p
def moddiv(a, b, p = MOD):
    return modmul(a, modpow(b, p-2, p))

""" initialize variables and set inputs

    
    

    
    
    
    
    

    
    
    
    

    
    
"""


r = lambda: sys.stdin.readline().strip()
r_int = lambda: int(r())
R = lambda: list(map(int, r().split()))
Rfloat = lambda: list(map(float, r().split()))
Rtuple = lambda: tuple(map(int, r().split()))
Rmap = lambda: map(int, r().split())

""" how to treat input







"""




A, B = R()
print(max(A+B,A+A-1,B+B-1))




"""memo: how to use defaultdict of list

Dic = defaultdict(list)

Dic[x].append(y)

for k, v in Dic.items():
"""

Solution (Python):
a, b = map(int, input().split())
cnt = 0

for i in range(2):
    if a > b:
        cnt += a
        a -= 1
    else:
        cnt += b
        b -= 1

print(cnt)

Solution (Python):
a,b= map(int,input().split())
if a==b:
  print(a+b)
else :
  print(max(a,b)*2-1)

Solution (Python):
a,b=map(int,input().split())

print(max(a+b, a*2-1,b*2-1))

Solution (Python):
def main():
    a, b = map(int, input().split())
    print(max(2*a-1, 2*b-1, a+b))


main()

Solution (Python):
a,b=map(int,(input().split()))
if a<b:
    tmp=a
    a=b
    b=tmp
if a-1>b:
    ans=a+a-1
else :
    ans=a+b
print(ans)

Solution (Python):
a, b = map(int, input().split())
sum = 0
for i in range(2):
    if a > b:
        sum += a
        a -= 1
    else:
        sum += b
        b -= 1
print(sum)

Solution (Python):
a, b = map(int, raw_input().split())        
if a == b:                                  
    print a * 2                             
else:                                       
    m = a                                   
    if m < b:                               
        m = b                               
    print m * 2 - 1

Solution (Python):
a, b = map(int, input().split())

total = 0
for i in range(2):
    if a > b:
        total += a
        a -= 1
    else:
        total += b
        b -= 1

print(total)

Solution (Python):
a,b=map(int,input().split())
print(max(a+b,a+a-1,b+b-1))

Solution (Python):
A, B = map(int, input().split())

if A == B:
    print(A+B)
else:
    print(2*max(A, B)-1)

Solution (Python):
def A(a,b):
    if a == b:
        return a+b
    elif a > b:
        return a+(a-1)
    elif b > a:
        return b+(b-1)

a,b = list(map(int,input().split(" ")))
print(A(a,b))

Solution (Python):
a, b = list(map(int, input().split()))
aa = a-1
bb = b-1
lst = sorted([a, b, aa, bb])

print(lst[2]+lst[3])

Solution (Python):
ls = list(map(int,input().split()))

ans = max(ls)
for i in range(len(ls)):
  if ls[i] == ans:
    ls[i] += -1
    break
ans += max(ls)
print(ans)

Solution (Python):
a, b = map(int, input().split())
c = 0
for i in range(2):
    if a > b:
        c += a
        a -= 1
    else:
        c += b
        b -= 1
print(c)

Solution (Python):
A,B, = map(int,(input().split(" ")))
X = int(0)
for i in range(2):
        if(A>=B):
                X += A
                A = A - 1
        else:
                X += B
                B = B-1
print(X)

Solution (Python):
a,b = map(int,input().split(' '))

ans = 0

if max(a,b) == a:
    ans += a
    a -= 1
else:
    ans += b
    b -= 1

if max(a,b) == a:
    ans += a
    a -= 1
else:
    ans += b
    b -= 1

print(ans)

Solution (Python):
a,b=map(int,input().split())
print(max(a+b, 2*a-1, 2*b-1))

Solution (Python):
a,b = map(int,input().split())
if a== b:print(a+b)
else:print(2*(a+b -min(a,b))-1)

Solution (Python):
a,b=map(int,input().split())
ans=0
if a>=b:
  ans+=a
  a-=1
  print(ans+max(a,b))
else:
  ans+=b
  b-=1
  print(ans+max(a,b))

Solution (Python):
a, b = map(int, input().split())
tmp = [a, b, a-1, b-1]
tmp = sorted(tmp)
print(tmp[-1]+tmp[-2])

Solution (Python):
AB=sorted(list(map(int,input().split())),reverse=True)

at=AB[0]*2-1
bt=AB[0]+AB[1]
print(max(at,bt))

Solution (Python):










import numpy as np
import math
import copy

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

n = 0

if a > b:
    n += a
    a = a - 1
else:
    n += b
    b = b - 1

if a > b:
    n += a
    a = a - 1
else:
    n += b
    b = b - 1

print(n)

Solution (Python):
a,b=map(int,input().split())
total=0
for i in range(2):
    if a<b:
        total+=b
        b-=1
    else:
        total+=a
        a-=1
print(total)

Solution (Python):
A, B = [int(x) for x in input().split()]
print(sum(sorted([A, A-1, B, B-1], reverse=True)[:2]))

Solution (Python):
a, b = list(map(int, input().split()))
s = 0
for i in range(2):
	if a >= b:
		s += a
		a -= 1
	else:
		s += b
		b -= 1
print(s)

Solution (Python):
A,B = map(int,input().split(' '))

money = 0
for i in range(2):
  if A >= B:
    money += A
    A -= 1
  else:
    money += B
    B -= 1
print(money)

Solution (Python):










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

if A>B:
    ans = A+(A-1)
elif A==B:
    ans = A+B
else:
    ans = B+(B-1)
print(ans)

Solution (Python):
a = list(map(int,input().split()))

if a[0]==a[1]:
  print(2*a[0])
else:
  print(2*max(a)-1)

Solution (Python):
A, B = map(int,input().split())

print(max(A+(A-1), B+(B-1), A+B))

Solution (Python):
a, b = map(int, input().split())

out = 0

for i in range(2):
    if a > b:
        out += a
        a -= 1
    elif a < b:
        out += b
        b -= 1
    else:
        out += a
        a -= 1
        
print(out)

Solution (Python):
x, y = map(int, raw_input().split())
ans = 0
for i in range(2):
    if x > y:
        ans += x
        x -= 1
    else:
        ans += y
        y -= 1
print ans

Solution (Python):
a,b = map(int,input().split())

cnt = 0
ans = 0

while cnt < 2:
    if a >= b:
        ans += a
        a -= 1
    else:
        ans += b
        b -=1
    cnt += 1
    
print(ans)

Solution (Python):
A,B=map(int,input().split())
L=[]
L.append(A)
L.append(B)
first=max(L)
L.remove(max(L))
L.append(first-1)
second=max(L)
print(first+second)

Solution (Python):
A, B = map(int, input().split())
List = [A, A-1, B, B-1]
List.sort()
print(List[-1]+List[-2])

Solution (Python):
A, B= map(int,input().split())

if A == B:
  print(A + B)
else:
  print(max(A, B) + (max(A, B) - 1))

Solution (Python):
a, b = map(int, input().split())
print(max(a+(a-1), a+b, b+a, b+(b-1)))

Solution (Python):
a, b = map(int, input().split())
if a>= b:
  i = a
  a -= 1
else:
  i = b
  b -= 1
  
if a>= b:
  j = a
  print(i+j)
else:
  j = b
  print(i+j)

Solution (Python):
a,b = map(int,input().split())
if a==b:
    ans=a+b
elif a>b:
    ans=a*2-1
else:
    ans=b*2-1
print(ans)

Solution (Python):

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

if a != b:
    s = max(a, b) * 2 -1
else:
    s = a*2
print(s)

Solution (Python):
a,b = map(int,input().split(" "))
val1=2*a-1
val2=2*b-1
val3=a+b
print(max(val1,val2,val3))

Solution (Python):
a, b = map(int, input().split())
print(max([a+(a-1), a+b, b+(b-1)]))

Solution (Python):
a,b=map(int,input().split())
if a==b:print(2*a)
else:print(2*max(a,b)-1)

Solution (Python):
A, B = map(int, input().split())
print(max((A + A - 1), (A + B), (B + B - 1 )))

Solution (Python):

A = list(map(int,input().split()))
if A[0]==A[1]:
    ans=A[0]*2
else:
    set=max(list(A))
    ans=set+(set-1)
print(ans)

Solution (Python):
a,b=map(int,input().split( ))

k=max(a,b)

if a==b:
    print(a*2)
else:
    print(2*k-1)

Solution (Python):
A,B = map(int,input().split())
n = 0
ans = []
while n <2:
    if A<B:
        ans.append(B)
        B -=1
        n +=1
    elif A>=B:
        ans.append(A)
        A -=1
        n +=1
print(sum(ans))

Solution (Python):
a ,b = map(int, input().split())

if a==b:
    print(a * 2)
else:
    c = max([a,b])
    print((c*2)-1)

Solution (Python):
A, B = map(int, input().split())
score = max(A, B) * 2 - 1 if A != B else A * 2
print(score)

Solution (Python):
A, B = map(int,input().split())
big, small  = max(A,B), min(A,B)
print(big + max((big -1), small))

Solution (Python):
a,b = map(int, input().split())
if a == b:
    print(2*a)
else:
    print(2*max(a,b)-1)

Solution (Python):
from sys import stdin


A, B = [int(x) for x in stdin.readline().rstrip().split()]

max = A + A -1
if max < A + B:
    max = A + B
if max < B + B - 1:
    max = B + B - 1

print(max)

Solution (Python):
a, b = map(int, input().split())

lst = list()
lst.append(a)
lst.append(b)

ans_sum = 0
i = lst.index(max(lst))
ans_sum += lst[i]

lst[i] = lst[i] - 1
ans_sum += max(lst)

print(ans_sum)

Solution (Python):
input=input().split()
coin=0
A=int(input[0])
B=int(input[1])
for i in range(2):
    if A>B:
        coin+=A
        A-=1
    else:
        coin+=B
        B-=1
print(coin)

Solution (Python):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

def main():
    A, B = MAP()
    if A - 1 > B:
        print(2 * A - 1)
    elif A < B - 1:
        print(2 * B - 1)
    else:
        print(A + B)

if __name__ == '__main__':
    main()

Solution (Python):
import sys

A, B = list(map(int,sys.stdin.readline().split()))

if A > B:
    print(A+max([A-1,B]))
else:
    print(B+max([A,B-1]))

Solution (Python):
A, B = map(int, input().split())
ans = 0

if A > B:
    ans += A
    A -= 1
else:
    ans += B
    B -= 1

print(ans+max(A, B))

Solution (Python):
list_ab = [int(x) for x in input().split()]
dict_ab = []
for x in list_ab:
  dict_ab.append(x)
dict_result = 0
for y in range(2):
  dic_max_i = max(dict_ab)
  dict_result = dict_result + dic_max_i
  dict_ab.remove(dic_max_i)
  dict_ab.append(dic_max_i-1)
print(dict_result)

Solution (Python):
A, B = list(map(int, input().split()))
if A == B :
    print(2*A)
else :
    print(2*max(A, B)-1)

Solution (Python):
A,B = map(int,input().split())
if A<B:
  print(2*B-1)
elif A==B:
  print(2*B)
else:
  print(2*A-1)

Solution (Python):
import sys
input = sys.stdin.readline

a,b = map(int, input().split())
coin = 0
for _ in range(2):
    if a > b:
        coin += a
        a -= 1
    else:
        coin += b
        b -= 1
print(coin)

Solution (Python):
a,b = map(int,input().split())
print(max([a*2-1,b*2-1,a+b]))

Solution (Python):
a,b=map(int,input().split())
print(max(a+b,2*a-1,2*b-1))

Solution (Python):
a,b = map(int,input().split())
lists = [2*a-1,a+b,2*b-1]
print(max(lists))

Solution (Python):
A, B = map(int, input().split())
score = 0

for i in range(2):
  if A >= B:
    score += A
    A -= 1
  else:
    score += B
    B -= 1
print(score)

Solution (Python):
a,b=map(int,input().split())
print(max([a+(a-1),b+(b-1),a+b]))

Solution (Python):
a, b = map(int, input().split())
print(max([a+b, a*2-1, b*2-1]))

Solution (Python):
a, b = map(int, input().split())
if a == b:
    print(a*2)
elif a > b:
    print(a*2-1)
else:
    print(b*2-1)

Solution (Python):
a,b=map(int,input().split())
answer=0
for i in range(2):
  if a<b:
    answer=answer+b
    b=b-1
  else:
    answer=answer+a
    a=a-1
print(answer)

Solution (Python):
a, b = map(int, input().split())
mx = max(a, b)
mn = min(a, b)
mx_ = mx - 1
print(mx + max(mn, mx_))

Solution (Python):
a,b=map(int,input().split())
if a>b:
  print(a+a-1)
elif a<b:
  print(b+b-1)
else:
  print(a+b)

Solution (Python):
A,B = map(int,input().split())

if A > B:
    print(A+(A-1))
elif A == B:
    print(A*2)
else:
    print(B+(B-1))

Solution (Python):
A,B=map(int,input().split())
print(max([2*A-1,2*B-1,A+B]))

Solution (Python):
s=list(map(int,input().split()))
a=0
if s[0]<s[1]:
  a=a+s[1]
  s[1]=s[1]-1
else:
  a=a+s[0]
  s[0]=s[0]-1
  
if s[0]<s[1]:
  a=a+s[1]
  s[1]=s[1]-1
else:
  a=a+s[0]
  s[0]=s[0]-1
print(a)

Solution (Python):
A, B = map(int, input().split()) 

if A >= B + 1:
    print(A+(A-1))
elif B >= A + 1:
    print(B+(B-1))
else:
    print(A*2)

Solution (Python):
A,B = map(int,input().split())
if A>B:
  print(2*A -1)
elif A<B:
  print(2*B -1)
else:
  print(A+B)

Solution (Python):
a,b = map(int, input().split())

coins = max(a,b)
if coins == a:
    a -= 1
elif coins == b:
    b -= 1
print(coins + max(a,b))

Solution (Python):
a,b = map(int,input().split())

if a == b:
    c = a + b
elif a < b:
    c = 2*b - 1
else:
    c = 2*a - 1
    
print(c)

Solution (Python):
A,B=map(int,input().split())
print((max(A,B)*2-1)+1*(A==B))

Solution (Python):
A, B = map(int, input().split())
ans = max(A, B)
if ans == A:
    A = A-1
else:
    B = B-1
print(ans + max(A, B))

Solution (Python):
a,b = map(int, input().split())

if a > b:
    big = a
    small = b
elif b > a:
    big = b
    small = a
elif a == b:
    big = a
    small = b

sum = big
big = big - 1
if big > small:
    sum += big
else:
    sum += small

print(sum)

Solution (Python):
A,B = (int(i) for i in input().split()) 
if A == B:
  answer = A + B
elif A > B :
  answer = A + A - 1
else:
  answer = B + B - 1
print(answer)

Solution (Python):
a,b=map(int,input().split())
print(max(2*a-1,2*b-1,a+b))

Solution (Python):
a,b=map(int,input().split())
k=0
for i in range(2):
  if a>b:
    k=k+a
    a-=1
  else:
    k=k+b
    b-=1
print(k)

Solution (Python):
a,b=map(int,input().split())
print(max(2*a-1,2*b-1,a+b))

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

result=0
for i in range(2):
    if A>B:
        result+=A
        A-=1
    else:
        result+=B
        B-=1

print(result)

Solution (Python):
a, b = map(int, input().split())
if a>b:
  print(a*2-1)
elif a==b:
  print(a+b)
else:
  print(b*2-1)

Solution (Python):
x,y=map(int,input().split())

if x>y:
  print(x+max(x-1,y))
else:
  print(y+max(x,y-1))

Solution (Python):
A,B=list(map(int,input().split()))
if A > B:
  print(A * 2 -1)
elif A == B:
  print(A + B)
else:
  print(B * 2 - 1)

Solution (Python):
A, B = map(int, input().split())
a = max(A,B)
b = min(A,B)
ans = 0
if(abs(a-b) > 0):
    ans = 2*a -1
else:
    ans = 2*a

print(ans)

Solution (Python):
a, b = map(int,input().split())
max = 0

max  = a + a - 1
if max < a + b:
    max = a + b
if max < b + b - 1:
    max = b + b - 1
print(max)

Solution (Python):
A = list(map(int, input().split()))
A.sort()
ans = 0
ans += A[1]
A[1] -= 1
A.sort()
ans += A[1]
print(ans)

Solution (Python):
a, b = list(map(int, input().split()))
s=0

if a<b:
  a,b=b,a
s+=a; a-=1
if a<b:
  a,b=b,a
s+=a; a-=1

print(s)

Solution (Python):
a,b = map(int, input().split())

if a < b:
  print((b+b)-1)
elif a > b:
  print((a+a)-1)
else:
  print(a+b)

Solution (Python):
a, b = map(int, input().split())

c = max(a, b)

if a > b:
    a -= 1
else:
    b -= 1

print(c + max(a,b))

Solution (Python):
a,b=map(int,input().split());print(max(a,b)*2-(a!=b))

Solution (Python):
li = list(map(int, input().split()))
print(sum(li) if li[0] == li[1] else max(li) * 2 - 1)

Solution (Python):
AB=list(map(int, input().split()));print(sum(AB) if len(set(AB))==1 else max(AB)+max(AB)-1)

Solution (Python):
x, y = map(int, input().split())
if x == y:
  print(2*x)
else:
  print(max(x, y)*2-1)

Solution (Python):
A,B = map(int, input().split())
print(max(A+A-1, B+B-1, A+B))

Solution (Python):
a,b = map(int,input().split())
x1 = a + (a-1)
x2 = a + b
x3 = b + b-1
print(max([x1, x2, x3]))

Solution (Python):
a,b=map(int,input().split())
x=0
if a>=b:
    x+=a
    a-=1
    if a>=b:
            x+=a
    else :
            x+=b
elif a<b:
    x+=b
    b-=1
    if a>=b:
            x+=a
    else :
            x+=b
print(x)

Solution (Python):
a, b = map(int, input().split())

if abs(a-b) >= 1:
    print(max(a, b) * 2 - 1)
else:
    print(a + b)

Solution (Python):
a, b = map(int, input().split())

li = [a, a-1,b,b-1]
li.sort()

print(li[-1]+li[-2])

Solution (Python):
a,b=map(int,input().split())
print(max(a,b)*2-(a!=b))

Solution (Python):
a,b=map(int,input().split())
print(max(a,b)*2-int(a!=b))

Solution (Python):
a,b = map(int,input().split())
print(max(a,b)*2-int(a!=b))

Solution (Python):

def nyan(f=lambda x: x): return map(f,input().split())

a,b = nyan(int)
print(max(a,b)*2-int(a!=b))

Solution (Python):
def abc():
    a, b = map(int, input().split())

    get_coin = 0
    for i in range(2):
        if a > b:
            get_coin += a
            a -= 1
        else:
            get_coin += b
            b -= 1
    print(get_coin)


abc()

Solution (Python):
a,b=map(int, input().split())
if a>=b:
	print(a+max(a-1,b))
else:
	print(b+max(a,b-1))

Solution (Python):
A,B=map(int,input().split())
print(max(A,B)*2-1+(A==B))

Solution (Python):
n1, n2 = [int(i) for i in input().split()]

r1 = 0
if n1 >= n2:
    r1 += n1
    n1 -= 1
else:
    r1 += n2
    n2 -= 1

r1 += max(n1, n2)

print(r1)

Solution (Python):
a, b = map(int, input().split())
print(max(a + a - 1, a + b, b + b - 1))

Solution (Python):
A,B = map(int,input().split())
ma = 0
if A > B:
    ma = A + A -1
elif A < B:
    ma = B + B - 1
else:
    ma = A * 2

print(ma)

Solution (Python):
A,B = map(int, input().split())
if A < B :
  print(B *2 -1)
elif A > B :
  print(A *2-1)
else :
  print(A*2)

Solution (Python):
A,B=map(int,input().split())

if A-1>=B:
    print(A*2-1)
elif B>=A+1:
    print(B*2-1)
else :
    print(A*2)

Solution (Python):
a, b = map(int, input().split())

ans = 0
for i in range(2):
    ans += max(a, b)
    if max(a, b) == a:
        a -= 1
    else :
        b -= 1

print(ans)

Solution (Python):
A, B = map(int,input().split())
if A>B:
  print(2*A-1)
elif B>A:
  print(2*B-1)
else:
  print(A+B)

Solution (Python):
A, B = map(int, input().split())
coin = 0
for _ in range(2):
    if A > B:
        coin += A
        A -= 1
    else:
        coin += B
        B -= 1
print(coin)

Solution (Python):

import numpy as np

A,B = map(int,raw_input().split())
coin = 0
for i in xrange(2):
  if A>B:
    coin += A
    A -= 1
  else:
    coin += B
    B -= 1

print coin

Solution (Python):

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





ans = 0

for i in range(2):

    if A > B:
        ans += A
        A -= 1
        
    else:
        ans += B
        B -= 1

print(ans)

Solution (Python):

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

A = int(A)
B = int(B)


ans = 0

for i in range(2):

    if A > B:
        ans += A
        A -= 1
        
    else:
        ans += B
        B -= 1

print(ans)

Solution (Python):
A, B = map(int, input().split(" "))
if abs(A - B) >= 2:
  print(max(A, B) + max(A, B) - 1)
else:
  print(max(A, B) + min(A, B))

Solution (Python):
A, B = map(int, input().split())
print(max(2*A-1, 2*B-1, A+B))

Solution (Python):
a, b = map(int, input().split())
if a < b:
    print(2*b-1)
elif a == b:
    print(2*a)
else:
    print(2*a-1)

Solution (Python):

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

ans = 0
for i in range(2):
    if a >= b:
        ans += a
        a -= 1
    else:
        ans += b
        b -= 1

print(ans)

Solution (Python):
a,b=map(int,input().split())
print(max(2*a-1,2*b-1,a+b))

Solution (Python):
A,B=map(int,input().split())
if A==B:
    print(A*2)
else:
    print(2*max(A,B)-1)

Solution (Python):
a,b=map(int,input().split())
print(max(a,b)+max(min(a,b),max(a,b)-1))

Solution (Python):
a,b=map(int,input().split())
c=0
for i in range(2):
  if a>b:
    c+=a
    a-=1
  else:
    c+=b
    b-=1
print(c)

Solution (Python):
a, b = map(int, input().split())

if a >= b:
    tmp1 = a
    a -= 1
else:
    tmp1 = b
    b -= 1

if a >= b:
    tmp2 = a
else:
    tmp2 = b

print(tmp1 + tmp2)

Solution (Python):
a, b = map(int, input().split())
if a > b:
    print(2 * a - 1)
elif a == b:
    print(2 * a)
else:
    print(2 * b - 1)

Solution (Python):
a,b = map(int,input().split())
p = max(a,b)
q = min(a,b)
print(p + max(p-1,q))

Solution (Python):
X, Y = map(int, input().split())
x = max(X,Y)
y = min(X, Y)
S = x + max(x-1, y)
print(S)

Solution (Python):
def Push(A,B):
	if A<=B:
		return B,A,B-1
	else:
		return A,A-1,B

def resolve():
	A,B=map(int,input().split())
	ans=0
	k,A,B=Push(A,B)
	ans+=k
	k,A,B=Push(A,B)
	ans+=k
	print(ans)

resolve()

Solution (Python):


num1, num2 = [int(i) for i in input().split()]
if num1 - num2 > 1:
    print(num1*2 -1)
elif num2 - num1 > 1:
    print(num2*2 -1)
else:
    print(num1 + num2)

Solution (Python):
A, B = list(map(int, input().split()))
if A > B:
    if A - 1 > B:
        print(A + A - 1)
    else:
        print(A + B)
elif B > A:
    if B - 1 > A:
        print(B + B - 1)
    else:
        print(A + B)
else:
    print(A + B)

Solution (Python):
a, b = list(map(int, input().split()))

ans = 0

for i in range(2):
    if a > b:
        ans += a
        a = a - 1
    else:
        ans += b
        b = b - 1

print(ans)

Solution (Python):
A,B = map(int, input().split())
ans = 0

if A > B:
    ans += A
    A -= 1
else:
    ans += B
    B -= 1

if A > B:
    ans += A
else:
    ans += B

print(ans)

Solution (Python):



import sys

input = sys.stdin.readline

def main():
    a, b = map(int, input().split())
    n = 0
    if a >= b + 2:
        n = a + a - 1
    elif a + 2 <= b:
        n = b + b - 1
    else:
        n = a + b
    print(n)

main()

Solution (Python):
a,b=map(int,input().split())
if a==b:
  print(2*a)
elif a>b:
  print(2*a-1)
else:
  print(2*b-1)

Solution (Python):
A, B = map(int, input().split())

print (max(A+B, 2*A-1, 2*B-1))

Solution (Python):
def money(A, B):
    if A<B:
        return 2*B-1
    elif A>B:
        return 2*A-1
    else:
        return A+B

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

print(coin)

Solution (Python):
A, B = map(int, input().split())

ans = 0

for i in range(2):
	if A > B:
		ans += A
		A -= 1
	else:
		ans += B
		B -= 1
		
print(ans)

Solution (Python):
inp = input().split(" ")
a = int(inp[0])
b = int(inp[1])
if a == b:
    print(a+b)
elif a > b:
    print(a*2-1)
else:
    print(b*2-1)

Solution (Python):
def method2():
    nums = list(map(int, input().split()))
    result=0
    if(nums[0]>nums[1]):
        result = nums[0]*2-1
    elif(nums[0]<nums[1]):
        result = nums[1]*2-1
    else:
        result = nums[0]*2
    print(result)
        

if __name__ == "__main__":
    method2()

Solution (Python):
A , B = map(int,input().split())

ans = 0

if A == B :
    ans = A + A
else :
    ans = 2 * max(A,B) - 1

print(ans)

Solution (Python):
A,B=map(int,input().split())

if A<3 or B>20:
    print("Unexpaected A,B")
    exit()
else :
    print(max(A+A-1,A+B,B+B-1))

Solution (Python):
a, b = map(int, input().split())
if a == b:
    print(a*2)
else:
    m = max(a ,b)
    print(m * 2 -1)

Solution (Python):
a,b=map(int,input().split())
x=a+b
y=a+a-1
z=b+b-1

nums=[x,y,z]

print(max(nums))

Solution (Python):
def apply(a,b):
  if a>b:
    return (a, a-1, b)
  else:
    return (b, a, b-1)

if __name__ == '__main__':
  a,b = map(int,input().split())
  res = 0
  tmp, a, b = apply(a,b)
  res += tmp
  tmp, a, b = apply(a,b)
  res += tmp
  print(res)

Solution (Python):
A, B = map(int, input().split())
print(max(A+B, A+A-1, B+B-1))

Solution (Python):
a,b = map(int, input().split())

if a > b:
  print( a +(a-1))
elif a == b:
  print(2*a)
else:
  print(b+ (b-1))

Solution (Python):

a,b = map(int,input().split())
if a - b>=1:
  print(a+a-1)
elif b-a>=1:
  print(b+b-1)
else:
  print(a+b)

Solution (Python):
A, B = map(int, input().split())

num = max(A, B)

if A == B:
    print(num + num)
else:
    print(num + num - 1)

Solution (Python):
A,B = map(int,input().split())

ans=0

for i in range(2):
    if(A>B):
        ans += A
        A -= 1
    else:
        ans +=B
        B -= 1
print(ans)

Solution (Python):
A,B = map(int,input().split())

ans=0

for i in range(2):
    if(A>B):
        ans += A
        A -= 1
    else:
        ans +=B
        B -= 1
print(ans)

Solution (Python):
a,b=map(int,input().split())
s=0
for i in range(2):
    if a>=b:
        s+=a
        a-=1
    else:
        s+=b
        b-=1
print(s)

Solution (Python):
a,b=map(int,input().split())
ans=0
if a-b>=0:
    ans+=a
    a-=1
    if a-b>=0:
        ans+=a
    else:
        ans+=b

else:
    ans+=b
    b-=1
    if b-a>=0:
        ans+=b
    else:
        ans+=a
print(ans)

Solution (Python):
[a,b]=map(int, input().split())
sum = 0
for n in range(2):
  if a <= b:
    sum += b
    b -= 1
  else :
    sum += a
    a -= 1
print(sum)

Solution (Python):
a,b=map(int,input().split(" "))
res=0
for i in range(2):
    if a >= b:
        res+=a
        a-=1
    else:
        res+=b
        b-=1
print(res)

Solution (Python):
A, B = map(int, input().split())
 
n = max(A, B)
if A != B:
	print(n + n-1)
else:
  print(n*2)

Solution (Python):
A, B = map(int, input().split())
two = [A, B]
if A==B:
    print(max(two)*2)
else:
    print(max(two)+max(two)-1)

Solution (Python):
a, b = [ int(v) for v in input().split() ]
print(max(a+b,a*2-1,b*2-1))

Solution (Python):
a,b=map(int,input().split())
print(max(2*a-1,a+b,2*b-1))

Solution (Python):
a, b = [int(i) for i in input().split()]

if(a == b):
  c = a * 2
else:
  c = max(a, b) * 2 - 1
print(c)

Solution (Python):
AB = input().split()
A = int(AB[0])
B = int(AB[1])
if A > B:
  print(2 * A - 1)
elif A < B:
  print(2 * B - 1)
else:
  print(2 * A)

Solution (Python):
a = [int(i) for i in input().split(" ")]
if a[0] == a[1]:
    print(2 * a[0])
else:
    print(2 * max(a) - 1)

Solution (Python):
from sys import stdin


def main():
    A, B = [int(x) for x in stdin.readline().split()]
    sum = 0
    for i in range(2):
        if A >= B:
            sum += A
            A -= 1
        else:
            sum += B
            B -= 1
    print(sum)


if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int,input().split())
if a>b:
  print(a+a-1)
elif a==b:
  print(a+b)
else:
  print(b+b-1)

Solution (Python):

import sys
S = 0

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

if A == B:
    S += A*2
    print(S)
    sys.exit()

if A > B:
    S += A
    A = A - 1

else:
    S += B
    B = B - 1

S += max(A,B)
print(S)

Solution (Python):
b1, b2 = sorted([int(x) for x in input().split()])

if b1 < b2:
    print(2 * b2 - 1)
else:
    print(2 * b2)

Solution (Python):
a,b=map(int,input().split())

print(max(a-1+a,b-1+b,a+b))

Solution (Python):
a,b=map(int,input().split())

f=max(a,b)
if a>b:
    s=max(a-1,b)
else:
    s=max(a,b-1)
print(f+s)

Solution (Python):
A, B = map(int, input().split())

ans = 0
ans += max(A, B)

if A >= B:
    A -= 1
else:
    B -= 1
    
ans += max(A,B)
print(ans)

Solution (Python):
import sys
import os

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

if A==B:
    print(A+B)
else:
    print(max(A,B)*2-1)