H,A,D=map(int,input().split())
dp=[0]*(H+11000)
for n in range(1,H+1):
	x=1.5+dp[n-D]
	y=1.0+dp[n-A]
	dp[n]=min(x,y)
print(dp[H])