We have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:

* There is at least one red block and at least one blue block.
* The union of all red blocks forms a rectangular parallelepiped.
* The union of all blue blocks forms a rectangular parallelepiped.



Snuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.

Constraints

* 2≤A,B,C≤10^9

Input

The input is given from Standard Input in the following format:


A B C


Output

Print the minimum possible difference between the number of red blocks and the number of blue blocks.

Examples

Input

3 3 3


Output

9


Input

2 2 4


Output

0


Input

5 3 5


Output

15
import java.util.*;
import java.io.*;
import java.math.*;

public class Main {

    int[] a;

    void solve() {
    	int A = sc.nextInt();
    	int B = sc.nextInt();
    	int C = sc.nextInt();

    	int max = Math.max(Math.max(A,B),C);

	BigInteger bA = BigInteger.valueOf(A);
	BigInteger bB = BigInteger.valueOf(B);
	BigInteger bC = BigInteger.valueOf(C);
	BigInteger tmp = bA.multiply(bB).multiply(bC);

    	BigInteger tmp2 = tmp.divide(BigInteger.valueOf(max));

    	if (tmp.remainder(BigInteger.valueOf(2)) == BigInteger.valueOf(0)) {
	    System.out.println(0);
    	} else {
	    System.out.println(tmp2);
    	}

    }

    void print(int[] a) {
    	out.print(a[0]);
    	for (int i = 1; i < a.length; i++) out.print(" " + a[i]);
    	out.println();
    }

    public static void main(String[] args) throws Exception {
    	new Main().run();
    }

    MyScanner sc = null;
    PrintWriter out = null;
    public void run() throws Exception {
    	sc = new MyScanner(System.in);
    	out = new PrintWriter(System.out);
    	for (;sc.hasNext();) {
    	    solve();
    	    out.flush();
    	}
    	out.close();
    }

    class MyScanner {
    	String line;
    	BufferedReader reader;
    	StringTokenizer tokenizer;

    	public MyScanner(InputStream stream) {
    	    reader = new BufferedReader(new InputStreamReader(stream));
    	    tokenizer = null;
    	}
    	public void eat() {
    	    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
    		try {
    		    line = reader.readLine();
    		    if (line == null) {
    			tokenizer = null;
    			return;
    		    }
    		    tokenizer = new StringTokenizer(line);
    		} catch (IOException e) {
    		    throw new RuntimeException(e);
    		}
    	    }
    	}
    	public String next() {
    	    eat();
    	    return tokenizer.nextToken();
    	}
    	public String nextLine() {
    	    try {
    		return reader.readLine();
    	    } catch (IOException e) {
    		throw new RuntimeException(e);
    	    }
    	}
    	public boolean hasNext() {
    	    eat();
    	    return (tokenizer != null && tokenizer.hasMoreElements());
    	}
    	public int nextInt() {
    	    return Integer.parseInt(next());
    	}
    	public long nextLong() {
    	    return Long.parseLong(next());
    	}
    	public double nextDouble() {
    	    return Double.parseDouble(next());
    	}
    	public int[] nextIntArray(int n) {
    	    int[] a = new int[n];
    	    for (int i = 0; i < n; i++) a[i] = nextInt();
    	    return a;
    	}
    }
}
