#include <stdio.h>

const int bit[21] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576};

int naive(int N, int A, int B)
{
	int i, j, k, ans = 1 << 30, tmp;
	for (k = 0; k < bit[N]; k++) {
		for (i = 0, tmp = 0; i < N; i++) {
			if ((k & bit[i]) != 0) tmp += B;
			else tmp -= B;
		}
		for (i = 0; i < N - 1; i++) {
			if ((k & bit[i]) == 0 && (k & bit[i+1]) == 0) tmp += A;
			else if ((k & bit[i]) != 0 && (k & bit[i+1]) != 0) tmp += A;
			else tmp -= A;
		}
		if (ans > tmp) ans = tmp;
	}
	return ans;
}

long long solve(long long N, long long A, long long B)
{
	long long ans = A * (N - 1) - B * N;
	if (N % 2 != 0) {
		if (ans > A * (1 - N) - B) ans = A * (1 - N) - B;
	} else {
		if (ans > A * (1 - N)) ans = A * (1 - N);
		if (ans > A * (3 - N) - B * 2) ans = A * (3 - N) - B * 2;
	}
	return ans;
}

int main()
{
	long long N, A, B;
	scanf("%lld %lld %lld", &N, &A, &B);
	printf("%lld\n", solve(N, A, B));
	fflush(stdout);
	return 0;
}