output_description: Print the maximum number of coins you can get.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B
attempt: # -*- coding: utf-8 -*-
  
  import sys
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def list2d(a, b, c):
      return [[c] * b for i in range(a)]
  
  
  def list3d(a, b, c, d):
      return [[[d] * c for j in range(b)] for i in range(a)]
  
  
  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 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
  
  A, B = MAP()
  
  if A == B:
      print(A * 2)
  else:
      print(max(A, B) * 2 - 1)
  
problem_description: 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?
samples: [{"input": "5 3", "output": "9\n    \n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this\nis the maximum result.\n\n* * *"}, {"input": "3 4", "output": "7\n    \n\n* * *"}, {"input": "6 6", "output": "12"}]