Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?

Constraints

* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.

Input

Input is given from Standard Input in the following format:


N A B


Output

Print the number of the different possible sums.

Examples

Input

4 4 6


Output

5


Input

5 4 3


Output

0


Input

1 7 10


Output

0


Input

1 3 3


Output

1
import java.util.*;

class Main{
    static Scanner sc = new Scanner(System.in);
    public static void main(String args[]){
        long N=sc.nextInt(),A=sc.nextInt(),B=sc.nextInt();
        if(A>B){
            System.out.println(0);
            return;
        }
        if(N==1){
            System.out.println(A==B?1:0);
            return;
        }
        long min=A*(N-1)+B,max=B*(N-1)+A;
        System.out.println(max-min+1);
    }
}