
def      lowerCamelCase__       (       __lowerCAmelCase						:						int = 1000       ):




			"""simple docstring"""


			lowerCAmelCase_      			=			2**power
			lowerCAmelCase_      			=			str(__lowerCAmelCase       )
			lowerCAmelCase_      			=			list(__lowerCAmelCase       )
			lowerCAmelCase_      			=			0

			for i in list_num:
						sum_of_num += int(__lowerCAmelCase       )

			return sum_of_num


if __name__ == "__main__":
			_A     =  int(input("Enter the power of 2: ").strip())
			print("2 ^ ", power, " = ", 2**power)
			_A     =  solution(power)
			print("Sum of the digits is: ", result)





def      lowerCamelCase__       (       __lowerCAmelCase						:						list[list[int]]					,							__lowerCAmelCase						:						int					,							__lowerCAmelCase						:						int					,							__lowerCAmelCase						:						set       ):




			"""simple docstring"""


			lowerCAmelCase_			,						lowerCAmelCase_      			=			len(__lowerCAmelCase       ), len(grid[0]       )
			if (
			    min(__lowerCAmelCase					,							__lowerCAmelCase       ) < 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_      			=			0
			count += depth_first_search(__lowerCAmelCase					,							row + 1					,							__lowerCAmelCase					,							__lowerCAmelCase       )
			count += depth_first_search(__lowerCAmelCase					,							row - 1					,							__lowerCAmelCase					,							__lowerCAmelCase       )
			count += depth_first_search(__lowerCAmelCase					,							__lowerCAmelCase					,							col + 1					,							__lowerCAmelCase       )
			count += depth_first_search(__lowerCAmelCase					,							__lowerCAmelCase					,							col - 1					,							__lowerCAmelCase       )

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


if __name__ == "__main__":
			import doctest

			doctest.testmod()



