

def       lowercase					(	__A :					int		)				->			int:





    '''simple docstring'''




    if divisor % 5 == 0 or divisor % 2 == 0:
        return 0
    snake_case							:		Tuple        =		1
    snake_case							:		Union[str, Any]        =		1
    while repunit:
        snake_case							:		Tuple        =		(10 * repunit + 1) % divisor
        repunit_index += 1
    return repunit_index







def       lowercase					(	__A :					int = 100_0000		)				->			int:





    '''simple docstring'''




    snake_case							:		Union[str, Any]        =		limit - 1
    if divisor % 2 == 0:
        divisor += 1
    while least_divisible_repunit(__A		) <= limit:
        divisor += 2
    return divisor


if __name__ == "__main__":
     print(f'''{solution() = }''')









'''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



