Problem Statement

The following game is called Game $n$:

The game is played by Alice and Bob. Initially, there are $n$ stones.

The players alternate turns, making a move described below, with Alice going first. The player who becomes unable to make a move loses.

• In Alice's turn, she must remove a number of stones that is a positive multiple of $A$.
• In Bob's turn, he must remove a number of stones that is a positive multiple of $B$.

In how many of Game $1$, Game $2$, ..., Game $N$ does Alice win when both players play optimally?

Constraints

• $1 \leq N ,A,B \leq 10^{18}$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

Print the answer.