



def      lowerCAmelCase__		(   lowerCamelCase_		:		list[list[int]]	,lowerCamelCase_		:		int	,lowerCamelCase_		:		int	,lowerCamelCase_		:		set):





				'''simple docstring'''

				lowerCAmelCase__						,		lowerCAmelCase__					:    Tuple												=					len(UpperCAmelCase_), len(grid[0])
				if (
				    min(UpperCAmelCase_	,UpperCAmelCase_) < 0
				    or row == row_length
				    or col == col_length
				    or (row, col) in visit
				    or grid[row][col] == 1
				):
								return 0
				if row == row_length - 1 and col == col_length - 1:
								return 1

				visit.add((row, col))

				lowerCAmelCase__					:    Any												=					0
				count += depth_first_search(UpperCAmelCase_	,row + 1	,UpperCAmelCase_	,UpperCAmelCase_)
				count += depth_first_search(UpperCAmelCase_	,row - 1	,UpperCAmelCase_	,UpperCAmelCase_)
				count += depth_first_search(UpperCAmelCase_	,UpperCAmelCase_	,col + 1	,UpperCAmelCase_)
				count += depth_first_search(UpperCAmelCase_	,UpperCAmelCase_	,col - 1	,UpperCAmelCase_)

				visit.remove((row, col))
				return count


if __name__ == "__main__":
					import doctest

					doctest.testmod()






from math import factorial






def      lowerCAmelCase__		(   lowerCamelCase_		:		int = 100):





				'''simple docstring'''

				return sum(map(lowerCamelCase_	,str(factorial(lowerCamelCase_))))


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

