Kurt 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 ≤ n ≤ 2⋅10^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⋅8⋅9=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).
from sys import stdin,stdout
from collections import defaultdict,Counter,deque
from bisect import bisect,bisect_left
import math
from itertools import permutations 
import queue




def sumOfDigits(x) :  
      
    prod = 1
    while (x) : 
        prod *= (x % 10)  
        x //= 10;  
      
    return prod 
# Returns the maximum number 
# with maximum sum of digits. 
def findMax(x) : 
      
    
    b = 1
    ans = x 
      
    
    while (x!=0) : 
        
        cur = (x - 1) * b + (b - 1) 
          
        
        if (sumOfDigits(cur) > sumOfDigits(ans) or
        (sumOfDigits(cur) == sumOfDigits(ans) and
            cur > ans)) : 
                ans = cur 
  
        # reduces the number 
        # to one unit less 
        x =x // 10
        b = b * 10
      
      
    return ans 




#stdin = open('input.txt','r')
I = stdin.readline
n = int(I())

ans = findMax(n)
prod = 1
for i in str(ans):
	prod*=(int(i))
print(prod)
