H, A, D = map(int, input().split())
dp = [0] * (H+1)

for i in range(1, H+1):
    dp[i] = min(dp[max(i-A, 0)]+1, dp[max(i-D, 0)]+1.5)

print(dp[H])