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.Scanner;

public class Main{
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int A = scan.nextInt();
		int B = scan.nextInt();
		if(N==1)
	    {
	        if(A==B)
	           System.out.println(1);
	        else
	          System.out.println(0);
	    }
	    else 
	    {
	        if(A>B)
	            System.out.println(0);
	        else
	           System.out.println((long )(B-A)*(N-2)+1);;
	    }
//		if (start > end) {
//			System.out.println(0);
//		} else {
//			if (n == 1 && start != end) {
//				System.out.println(0);
//			} else {
//				System.out.println((long)(start + end * (n - 1)) - (long)(end + start * (n - 1)) + 1);
//			}
//
//		}
		//int max=Math.max(0,(start + end * (n - 1)) - (end + start * (n - 1)) + 1);
		//System.out.println(max);
	}

}
