JUNGOL

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!

Problem credits: Nathan Pinsker

Input

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

Output

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

Example

Source

USACO 2015 December Gold

#3942

Fruit Feast 2s 512MB

Problems

Input

Output

Example

Source

#3942 upload 1 done 1 how_to_reg 1

Fruit Feast timer 2s memory 512MB

Problems text_fields

Input

Output

Example

Source

Backlinks Official problem sets only

#3942

Fruit Feast 2s 512MB

Problems