code: 
  
  from __future__ import annotations
  def        __SCREAMING_SNAKE_CASE    (      a__						:      float | int ,a__						:      float | int ,a__						:      float | int ,)				->							list[float | int]:
  	if not all((nth_term, start_term_a, common_ratio_r)					):
  		return []
  	__A   : list[float | int]								= []
  	__A   : Dict								= 1
  	__A   : Tuple								= common_ratio_r
  	for _ in range(int(a__					)					):
  		if not series:
  			series.append(a__					)
  		else:
  			power += 1
  			series.append(float(start_term_a * multiple					)					)
  			__A   : int								= pow(float(a__					) ,a__					)
  	return series
  
  
  if __name__ == "__main__":
  			import doctest
  
  			doctest.testmod()
  
  			UpperCAmelCase_       :				Dict		   =      float(input('''Enter the last number (n term) of the Geometric Series'''))
  			UpperCAmelCase_       :				Union[str, Any]		   =      float(input('''Enter the starting term (a) of the Geometric Series'''))
  			UpperCAmelCase_       :				Any		   =      float(
  			    input('''Enter the common ratio between two terms (r) of the Geometric Series''')
  			)
  			print('''Formula of Geometric Series => a + ar + ar^2 ... +ar^n''')
  			print(geometric_series(nth_term, start_term_a, common_ratio_r))
  
  
  
  
  
  
style_context: 
  
  UpperCAmelCase_       :				str		   =      [
      [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        __SCREAMING_SNAKE_CASE    (      a__						:      int ,a__						:      int ,a__						:      int ,a__						:      int					)				->							bool:
  	return 0 <= row < rows and 0 <= col < cols
  def        __SCREAMING_SNAKE_CASE    (      a__						:      int ,a__						:      int ,a__						:      set ,a__						:      list[list[int]]					)				->							int:
  	__A   : Union[str, Any]								= len(a__					)
  	__A   : Any								= len(mat[0]					)
  	if is_safe(a__ ,a__ ,a__ ,a__					) and (row, col) not in seen and mat[row][col] == 1:
  		seen.add((row, col)					)
  		return (
  		    1
  		    + depth_first_search(row + 1 ,a__ ,a__ ,a__					)
  		    + depth_first_search(row - 1 ,a__ ,a__ ,a__					)
  		    + depth_first_search(a__ ,col + 1 ,a__ ,a__					)
  		    + depth_first_search(a__ ,col - 1 ,a__ ,a__					)
  		)
  	else:
  		return 0
  def        __SCREAMING_SNAKE_CASE    (      a__						:      list[list[int]]					)				->							int:
  	__A   : set								= set()
  
  	__A   : Union[str, Any]								= 0
  	for row, line in enumerate(a__					):
  		for col, item in enumerate(a__					):
  			if item == 1 and (row, col) not in seen:
  				# Maximizing the area
  				__A   : Optional[Any]								= max(a__ ,depth_first_search(a__ ,a__ ,a__ ,a__					)					)
  	return max_area
  
  
  if __name__ == "__main__":
  			import doctest
  
  			print(find_max_area(matrix))  # Output -> 6
  			doctest.testmod()
  
  
  
  
  
  