H,A,D = map(int,input().split())
#何回通常攻撃をするのが最適か
ans = 100001
for i in range(H//A+1):
    HP = H-i*A
    n = i + (-(-HP//D))*3/2
    ans =min(ans,n)
print(ans)