Problem: zscoder wants to generate an input file for some programming competition problem.

His input is a string consisting of n letters 'a'. He is too lazy to write a generator so he will manually generate the input in a text editor.

Initially, the text editor is empty. It takes him x seconds to insert or delete a letter 'a' from the text file and y seconds to copy the contents of the entire text file, and duplicate it.

zscoder wants to find the minimum amount of time needed for him to create the input file of exactly n letters 'a'. Help him to determine the amount of time needed to generate the input.

Input

The only line contains three integers n, x and y (1 ≤ n ≤ 107, 1 ≤ x, y ≤ 109) — the number of letters 'a' in the input file and the parameters from the problem statement.

Output

Print the only integer t — the minimum amount of time needed to generate the input file.

Examples

Input

8 1 1


Output

4


Input

8 1 10


Output

8

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class CF710E {
	public static void main(String[] args) throws FileNotFoundException {
		InputStream inputStream = System.in;
//		InputStream inputStream = new FileInputStream(new File("input"));
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskA solver = new TaskA();
		solver.solve(1, in, out);
		out.close();
	}

	static class TaskA {
		static final int MAX = (int) 1e7;
		long[] dis = new long[MAX + 5];

		public void solve(int testNumber, InputReader in, PrintWriter out) {
			int n = in.nextInt();
			int x = in.nextInt();
			int y = in.nextInt();
			Arrays.fill(dis, Long.MAX_VALUE / 2);
			dis[0] = 0;

			// First
			for (int i = 1; i <= n; ++i) {
				if (i % 2 == 0) {
					dis[i] = Math.min(dis[i - 1] + x, dis[i/2] + y);
				} else {
					dis[i] = Math.min(dis[i - 1] + x, dis[(i + 1)/ 2] + y + x);
				}
			}

			// Second
			for (int i = 1; i <= n; ++i) {
				dis[i] = Math.min(dis[i], dis[i + 1] + x);
				dis[i] = Math.min(dis[i - 1] + x, dis[i]);
				if (i % 2 == 0) {
					dis[i] = Math.min(dis[i], dis[i / 2] + y);
				} else {
					dis[i] = Math.min(dis[i], dis[(i + 1)/2] + y + x);
				}
			}

			out.println(dis[n]);
		}

	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}
	}
}