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: s = list(input())
  count = 0
  n = len(s)
  if n % 2 == 0:
      for i in range(0, int(n / 2)):
          if s[(2 * i) + 1] == "0":
              count = count + 1
              print(i)
      for j in range(0, int(n / 2)):
          if s[2 * j] == "1":
              count = count + 1
              print(j)
  else:
      for i in range(0, int((n - 1) / 2) + 1):
          if s[2 * i] == "0":
              count = count + 1
      for j in range(0, int(((n - 1) / 2))):
          if s[2 * j + 1] == "1":
              count = count + 1
  count2 = n - count
  print(min(count, count2))
  
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"}]