

"""simple docstring"""





def   _A  (  UpperCamelCase_     :       int)	->						Dict:
   '''simple docstring'''


   if divisor % 5 == 0 or divisor % 2 == 0:
      return 0
   __lowercase								=						1
   __lowercase								=						1
   while repunit:
      __lowercase								=						(10 * repunit + 1) % divisor
      repunit_index += 1
   return repunit_index




def   _A  (  UpperCamelCase_     :       int = 1000000)	->						Optional[Any]:
   '''simple docstring'''


   __lowercase								=						limit - 1
   if divisor % 2 == 0:
      divisor += 1
   while least_divisible_repunit(SCREAMING_SNAKE_CASE__) <= limit:
      divisor += 2
   return divisor


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








def 	a_      (    SCREAMING_SNAKE_CASE__					:      str		,			SCREAMING_SNAKE_CASE__					:      str     ):
       '''simple docstring'''





       assert x is not None
       assert y is not None

       _lowerCamelCase       :		Dict		=len(SCREAMING_SNAKE_CASE__     )
       _lowerCamelCase       :		Optional[Any]		=len(SCREAMING_SNAKE_CASE__     )

       # declaring the array for storing the dp values
       _lowerCamelCase       :		Optional[int]		=[[0] * (n + 1) for _ in range(m + 1     )]  # noqa: E741

       for i in range(1		,			m + 1     ):
              for j in range(1		,			n + 1     ):
                     _lowerCamelCase       :		int		=1 if x[i - 1] == y[j - 1] else 0

                     _lowerCamelCase       :		Union[str, Any]		=max(l[i - 1][j]		,			l[i][j - 1]		,			l[i - 1][j - 1] + match     )

       _lowerCamelCase       :		Optional[int]		=''
       _lowerCamelCase	,     _lowerCamelCase       :		Dict		=m, n
       while i > 0 and j > 0:
              _lowerCamelCase       :		int		=1 if x[i - 1] == y[j - 1] else 0

              if l[i][j] == l[i - 1][j - 1] + match:
                     if match == 1:
                            _lowerCamelCase       :		Union[str, Any]		=x[i - 1] + seq
                     i -= 1
                     j -= 1
              elif l[i][j] == l[i - 1][j]:
                     i -= 1
              else:
                     j -= 1

       return l[m][n], seq


if __name__ == "__main__":
 lowerCamelCase											=       'AGGTAB'
 lowerCamelCase											=       'GXTXAYB'
 lowerCamelCase											=       4
 lowerCamelCase											=       'GTAB'

 lowerCamelCase					,				lowerCamelCase											=       longest_common_subsequence(a, b)
 print('len =', ln, ', sub-sequence =', subseq)
 import doctest

 doctest.testmod()


