output_description: Print the maximum possible number of biscuits in Snuke's pocket after K
  operations.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      K A B
attempt: from math import log
  
  k, a, b = [int(i) for i in input().split()]
  
  N = []
  
  for n in range(1, (k + 1) // a + 1):
      x = n * a - 1
      # y = int(log((b/a-1)*k+1, b/a))
      # z = y
      # m = 1 + x - a*y + b*z
      # y = y+1
      # z= z+1
      # mm = 1 + x - a*y + b*z
      # mmm = [m, mm]
      # N.append(max(mmm))
      y = (k - x) // 2
      z = y
      N.append(1 + x - a * y + b * z)
  N.append(k + 1)
  print(max(N))
  
problem_description: Statement
  
  Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He
  will perform the following operations exactly K times in total, in the order
  he likes:
  
    * Hit his pocket, which magically increases the number of biscuits by one.
    * Exchange A biscuits to 1 yen.
    * Exchange 1 yen to B biscuits.
  
  Find the maximum possible number of biscuits in Snuke's pocket after K
  operations.
samples: [{"input": "4 2 6", "output": "7\n    \n\nThe number of biscuits in Snuke's pocket after K operations is maximized as\nfollows:\n\n  * Hit his pocket. Now he has 2 biscuits and 0 yen.\n  * Exchange 2 biscuits to 1 yen. his pocket. Now he has 0 biscuits and 1 yen.\n  * Hit his pocket. Now he has 1 biscuits and 1 yen.\n  * Exchange 1 yen to 6 biscuits. his pocket. Now he has 7 biscuits and 0 yen.\n\n* * *"}, {"input": "7 3 4", "output": "8\n    \n\n* * *"}, {"input": "314159265 35897932 384626433", "output": "48518828981938099"}]