# coding: utf-8 import sys sys.setrecursionlimit(10 ** 6) def II(): return int(input()) def ILI(): return list(map(int, input().split())) def read(): N = II() C, V = ILI() return N, C, V def do_copy_paste(now_length, now_cost, now_clip, N, C, V): if now_length >= N: return now_cost if now_clip == 0: copy = do_copy_paste(now_length, now_cost + C, now_length, N, C, V) return copy if now_length == now_clip: paste = do_copy_paste(now_length + now_clip, now_cost + V, now_clip, N, C, V) return paste copy = do_copy_paste(now_length, now_cost + C, now_length, N, C, V) paste = do_copy_paste(now_length + now_clip, now_cost + V, now_clip, N, C, V) return min(copy, paste) def solve(N, C, V): ans = do_copy_paste(1, 0, 0, N, C, V) return ans def main(): params = read() print(solve(*params)) if __name__ == "__main__": main()