Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Expression

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPetya studies in a school and he adores Maths. His class has been studying arithmetic expressions. On the last class the teacher wrote three positive integers *a*, *b*, *c* on the blackboard. The task was to insert signs of operations '+' and '*', and probably brackets between the numbers so that the value of the resulting expression is as large as possible. Let's consider an example: assume that the teacher wrote numbers 1, 2 and 3 on the blackboard. Here are some ways of placing signs and brackets:

- 1+2*3=7
- 1*(2+3)=5
- 1*2*3=6
- (1+2)*3=9

Note that you can insert operation signs only between *a* and *b*, and between *b* and *c*, that is, you cannot swap integers. For instance, in the given sample you cannot get expression (1+3)*2.

It's easy to see that the maximum value that you can obtain is 9.

Your task is: given *a*, *b* and *c* print the maximum value that you can get.

Input

The input contains three integers *a*, *b* and *c*, each on a single line (1 ≤ *a*, *b*, *c* ≤ 10).

Output

Print the maximum value of the expression that you can obtain.

Examples

Input

1

2

3

Output

9

Input

2

10

3

Output

60

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/26/2018 02:54:56 (d3).

Desktop version, switch to mobile version.

User lists

Name |
---|