



'''simple docstring'''



a__						:			Dict										=			[
    [0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0],
    [0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0],
    [0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0],
    [0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0],
]







def _lowercase   (  __A							,__A							,__A							,__A       ):



 '''simple docstring'''



 return 0 <= row < rows and 0 <= col < cols







def _lowercase   (  __A							,__A							,__A							,__A       ):



 '''simple docstring'''



 __UpperCamelCase				      =  len(lowercase__       )
 __UpperCamelCase				      =  len(mat[0]       )
 if is_safe(lowercase__							,lowercase__							,lowercase__							,lowercase__       ) and (row, col) not in seen and mat[row][col] == 1:
  seen.add((row, col)       )
  return (
      1
      + depth_first_search(row + 1							,lowercase__							,lowercase__							,lowercase__       )
      + depth_first_search(row - 1							,lowercase__							,lowercase__							,lowercase__       )
      + depth_first_search(lowercase__							,col + 1							,lowercase__							,lowercase__       )
      + depth_first_search(lowercase__							,col - 1							,lowercase__							,lowercase__       )
  )
 else:
  return 0







def _lowercase   (  __A       ):



 '''simple docstring'''



 __UpperCamelCase				      =  set()

 __UpperCamelCase				      =  0
 for row, line in enumerate(lowercase__       ):
  for col, item in enumerate(lowercase__       ):
   if item == 1 and (row, col) not in seen:
    # Maximizing the area
    __UpperCamelCase				      =  max(lowercase__							,depth_first_search(lowercase__							,lowercase__							,lowercase__							,lowercase__       )       )
 return max_area


if __name__ == "__main__":
      import doctest

      print(find_max_area(matrix))  # Output -> 6
      doctest.testmod()










'''simple docstring'''



a__						:			str										=			[chr(i) for i in range(3_2, 1_2_6)]
a__						:			List[Any]										=			list(range(len(alphabets)))
a__						:			Union[str, Any]										=			list(range(len(alphabets)))
a__						:			Dict										=			list(range(len(alphabets)))
a__						:			Union[str, Any]										=			list(reversed(range(len(alphabets))))
a__						:			List[str]										=			[]
a__						:			int										=			0







def _lowercase   (  ):



 '''simple docstring'''



 global gear_one_pos
 global gear_two_pos
 global gear_three_pos
 __UpperCamelCase				      =  gear_one[0]
 gear_one.append(__A       )
 del gear_one[0]
 gear_one_pos += 1
 if gear_one_pos % int(len(__A       )       ) == 0:
  __UpperCamelCase				      =  gear_two[0]
  gear_two.append(__A       )
  del gear_two[0]
  gear_two_pos += 1
  if gear_two_pos % int(len(__A       )       ) == 0:
   __UpperCamelCase				      =  gear_three[0]
   gear_three.append(__A       )
   del gear_three[0]
   gear_three_pos += 1







def _lowercase   (  __A       ):



 '''simple docstring'''



 __UpperCamelCase				      =  alphabets.index(__A       )
 __UpperCamelCase				      =  gear_one[target]
 __UpperCamelCase				      =  gear_two[target]
 __UpperCamelCase				      =  gear_three[target]
 __UpperCamelCase				      =  reflector[target]
 __UpperCamelCase				      =  gear_three.index(__A       )
 __UpperCamelCase				      =  gear_two.index(__A       )
 __UpperCamelCase				      =  gear_one.index(__A       )
 code.append(alphabets[target]       )
 rotator()


if __name__ == "__main__":
 a__						:			Any										=			list(input('Type your message:\n'))
 while True:
  try:
   a__						:			List[Any]										=			int(input('Please set token:(must be only digits)\n'))
   break
  except Exception as error:
   print(error)
 for _ in range(token):
  rotator()
 for j in decode:
  engine(j)
 print('\n' + ''.join(code))
 print(
     f'''\nYour Token is {token} please write it down.\nIf you want to decode '''
     'this message again you should input same digits as token!'
 )





