





from heapq import heappop, heappush

import numpy as np






def    _A	(   lowerCamelCase				,			lowerCamelCase				,			lowerCamelCase				,			lowerCamelCase				,			):
   a__		,  a__						:    Dict   		=	grid.shape
   a__						:    Union[str, Any]   		=	[-1, 1, 0, 0]
   a__						:    Union[str, Any]   		=	[0, 0, -1, 1]
   if allow_diagonal:
      dx += [-1, -1, 1, 1]
      dy += [-1, 1, -1, 1]

   a__		,  a__						:    int   		=	[(0, source)], set()
   a__						:    Optional[int]   		=	np.full((rows, cols)				,			np.inf )
   a__						:    List[str]   		=	0
   a__						:    List[str]   		=	np.empty((rows, cols)				,			dtype=lowerCamelCase )
   a__						:    Any   		=	None

   while queue:
      ((a__)		,  (a__))						:    Any   		=	heappop(lowerCamelCase )
      if (x, y) in visited:
         continue
      visited.add((x, y) )

      if (x, y) == destination:
         a__						:    int   		=	[]
         while (x, y) != source:
            path.append((x, y) )
            a__		,  a__						:    Any   		=	predecessors[x, y]
         path.append(lowerCamelCase )  # add the source manually
         path.reverse()
         return matrix[destination], path

      for i in range(len(lowerCamelCase ) ):
         a__		,  a__						:    Tuple   		=	x + dx[i], y + dy[i]
         if 0 <= nx < rows and 0 <= ny < cols:
            a__						:    Tuple   		=	grid[nx][ny]
            if next_node == 1 and matrix[nx, ny] > dist + 1:
               heappush(lowerCamelCase				,			(dist + 1, (nx, ny)) )
               a__						:    Union[str, Any]   		=	dist + 1
               a__						:    int   		=	(x, y)

   return np.inf, []


if __name__ == "__main__":
  import doctest

  doctest.testmod()








def    _A	(   lowerCamelCase ):
   a__						:    Optional[Any]   		=	1
   for i in range(1				,			num + 1 ):
      fact *= i
   return fact






def    _A	(   lowerCamelCase ):
   a__						:    List[Any]   		=	0
   while number > 0:
      a__						:    str   		=	number % 10
      sum_of_digits += last_digit
      a__						:    Dict   		=	number // 10  # Removing the last_digit from the given number
   return sum_of_digits






def    _A	(   lowerCamelCase = 100 ):
   a__						:    Any   		=	factorial(lowerCamelCase )
   a__						:    Optional[Any]   		=	split_and_add(lowerCamelCase )
   return result


if __name__ == "__main__":
  print(solution(int(input("""Enter the Number: """).strip())))

