시간 제한메모리 제한제출정답맞은 사람정답 비율
2 초 512 MB42318015743.251%

문제

Bessie has broken into Farmer John's house again! She has discovered a pile of lemons and a pile of oranges in the kitchen (effectively an unlimited number of each), and she is determined to eat as much as possible.

Bessie has a maximum fullness of \(T\) (\(1 \le T \le 5,000,000\)). Eating an orange increases her fullness by \(A\), and eating a lemon increases her fullness by \(B\) (\(1 \le A, B \le T\)). Additionally, if she wants, Bessie can drink water at most one time, which will instantly decrease her fullness by half (and will round down).

Help Bessie determine the maximum fullness she can achieve!

입력

The first (and only) line has three integers \(T\), \(A\), and \(B\).

출력

A single integer, representing the maximum fullness Bessie can achieve.

예제 입력 1

8 5 6

예제 출력 1

8

출처

Olympiad > USA Computing Olympiad > 2015-2016 Season > USACO December 2015 Contest > Gold 2번