Problem7876--USACO 2015 December Contest, Gold —— Problem 2. Fruit Feast

7876: USACO 2015 December Contest, Gold —— Problem 2. Fruit Feast

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 256 MiB

Description

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≤T≤5,000,000). Eating an orange increases her fullness by A, and eating a lemon increases her fullness by B (1≤A,B≤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!

Input

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

Output

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

Sample 1 Input

8 5 6

Sample 1 Output

8

HINT

相同题目:USACO Gold

Source/Category