Rating changes for the last round are temporarily rolled back. They will be returned soon.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

B. Nirvana

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputKurt reaches nirvana when he finds the product of all the digits of some positive integer. Greater value of the product makes the nirvana deeper.

Help Kurt find the maximum possible product of digits among all integers from $$$1$$$ to $$$n$$$.

Input

The only input line contains the integer $$$n$$$ ($$$1 \le n \le 2\cdot10^9$$$).

Output

Print the maximum product of digits among all integers from $$$1$$$ to $$$n$$$.

Examples

Input

390

Output

216

Input

7

Output

7

Input

1000000000

Output

387420489

Note

In the first example the maximum product is achieved for $$$389$$$ (the product of digits is $$$3\cdot8\cdot9=216$$$).

In the second example the maximum product is achieved for $$$7$$$ (the product of digits is $$$7$$$).

In the third example the maximum product is achieved for $$$999999999$$$ (the product of digits is $$$9^9=387420489$$$).

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/28/2020 18:24:02 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|