


def 			_a      (    __UpperCamelCase			):
     a_     :  Dict				      =     1
     a_     :  Dict				      =     0
     a_     :  str				      =     1
     a_     :  Any				      =     1
     a_     :  Optional[Any]				      =     3
     a_     :  List[Any]				      =     3
     a_     :  List[Any]				      =     limit
     a_     :  int				      =     0

     a_     :  int				      =     """"""
     while counter != decimal + 1:
          if 4 * q + r - t < n * t:
               result += str(__UpperCamelCase			)
               if counter == 0:
                    result += "."

               if decimal == counter:
                    break

               counter += 1
               a_     :  Dict				      =     1_0 * (r - n * t)
               a_     :  Any				      =     ((1_0 * (3 * q + r)) // t) - 1_0 * n
               q *= 1_0
               a_     :  int				      =     nr
          else:
               a_     :  List[Any]				      =     (2 * q + r) * l
               a_     :  Optional[Any]				      =     (q * (7 * k) + 2 + (r * l)) // (t * l)
               q *= k
               t *= l
               l += 2
               k += 1
               a_     :  Tuple				      =     nn
               a_     :  Dict				      =     nr
     return result



def 			_a      (    ):
     print(F'''{calculate_pi(5_0			) = }'''			)
     import doctest

     doctest.testmod()


if __name__ == "__main__":
       main()







class 	a__						:

       def __init__( self   :  int   ,				lowerCamelCase_   :  int     ):
            a_     :  Dict				      =     data
            a_     :  int
            a_     :  Node



def 			_a      (    __UpperCamelCase			):
     a_     :  int				      =     0
     a_     :  Optional[Any]				      =     x



def 			_a      (    __UpperCamelCase	,	__UpperCamelCase			):
     a_      ,      a_     :  Dict				      =     find_set(__UpperCamelCase			), find_set(__UpperCamelCase			)
     if x == y:
          return

     elif x.rank > y.rank:
          a_     :  Tuple				      =     x
     else:
          a_     :  Optional[Any]				      =     y
          if x.rank == y.rank:
               y.rank += 1



def 			_a      (    __UpperCamelCase			):
     if x != x.parent:
          a_     :  Tuple				      =     find_set(x.parent			)
     return x.parent



def 			_a      (    __UpperCamelCase			):
     a_     :  List[Any]				      =     ({0, 1, 2}, {3, 4, 5})
     for s in sets:
          if node.data in s:
               return s
     a_     :  Union[str, Any]				      =     F'''{node.data} is not in {sets}'''
     raise ValueError(__UpperCamelCase			)



def 			_a      (    ):
     a_     :  int				      =     [Node(__UpperCamelCase			) for i in range(6			)]
     for v in vertex:
          make_set(__UpperCamelCase			)

     union_set(vertex[0]	,	vertex[1]			)
     union_set(vertex[1]	,	vertex[2]			)
     union_set(vertex[3]	,	vertex[4]			)
     union_set(vertex[3]	,	vertex[5]			)

     for nodea in vertex:
          for nodea in vertex:
               if find_python_set(__UpperCamelCase			).isdisjoint(find_python_set(__UpperCamelCase			)			):
                    assert find_set(__UpperCamelCase			) != find_set(__UpperCamelCase			)
               else:
                    assert find_set(__UpperCamelCase			) == find_set(__UpperCamelCase			)


if __name__ == "__main__":
       test_disjoint_set()



