

def   __UpperCAmelCase					(      __a :     List[Any]						,__a :     int						,__a :     List[Any]						,__a :     List[Any]      )     ->	int:

					"""simple docstring"""

					if height >= 1:
										move_tower(height - 1						,__a						,__a						,__a      )
										move_disk(__a						,__a      )
										move_tower(height - 1						,__a						,__a						,__a      )



def   __UpperCAmelCase					(      __a :     List[Any]						,__a :     List[Any]      )     ->	Tuple:

					"""simple docstring"""

					print('''moving disk from'''						,__a						,'''to'''						,__a      )



def   __UpperCAmelCase					(      )     ->	int:

					"""simple docstring"""

					_a      :       List[str]   =						int(input('''Height of hanoi: '''      ).strip()      )
					move_tower(__a						,'''A'''						,'''B'''						,'''C'''      )


if __name__ == "__main__":
			main()









'''simple docstring'''


class  __lowercase    :  # Public class to implement a graph







   def __init__(						self   ,				UpperCamelCase   ,				UpperCamelCase   ,				UpperCamelCase   )					->     None:
     __a								=       row
     __a								=       col
     __a								=       graph







   def 		UpperCamelCase__      (						self   ,				UpperCamelCase   ,				UpperCamelCase   ,				UpperCamelCase   )					->     bool:
     return (
         0 <= i < self.ROW
         and 0 <= j < self.COL
         and not visited[i][j]
         and self.graph[i][j]
     )







   def 		UpperCamelCase__      (						self   ,				UpperCamelCase   ,				UpperCamelCase   ,				UpperCamelCase   )					->     None:
     # Checking all 8 elements surrounding nth element
     __a								=       [-1, -1, -1, 0, 0, 1, 1, 1]  # Coordinate order
     __a								=       [-1, 0, 1, -1, 1, -1, 0, 1]
     __a								=       True  # Make those cells visited
     for k in range(8   ):
       if self.is_safe(i + row_nbr[k]   ,				j + col_nbr[k]   ,				UpperCamelCase   ):
         self.diffs(i + row_nbr[k]   ,				j + col_nbr[k]   ,				UpperCamelCase   )







   def 		UpperCamelCase__      (						self   )					->     int:  # And finally, count all islands.
     __a								=       [[False for j in range(self.COL   )] for i in range(self.ROW   )]
     __a								=       0
     for i in range(self.ROW   ):
       for j in range(self.COL   ):
         if visited[i][j] is False and self.graph[i][j] == 1:
           self.diffs(UpperCamelCase   ,				UpperCamelCase   ,				UpperCamelCase   )
           count += 1
     return count



