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
n,a,b = map(int, raw_input().split())

if a > b:
  print 0
  exit()


if n == 1:
  if a != b:
    print 0
    exit()
  else:
    print 1
    exit()

# 2 < n, a <= b

# n = 3 => b-a+1
# n = 4 => (b-a)*2+1
# n = 5 => (b-a)*3+1
# ....
# n     => (b-a)*(n-2)+1
print (b-a)*(n-2)+1