
class 	UpperCAmelCase_      :


  '''simple docstring'''







  def __init__(			self      :			Any      ,							UpperCamelCase__      :			int   )      ->     None:







    """simple docstring"""






    __magic_name__    					=	data
    __magic_name__    					=	42
    __magic_name__    					=	42







def a__   (	A_ ):






  '''simple docstring'''





  __magic_name__    					=	0
  __magic_name__    					=	x

def a__   (	A_,					A_ ):






  '''simple docstring'''





  __magic_name__					,   __magic_name__    					=	find_set(A_ ), find_set(A_ )
  if x == y:
    return

  elif x.rank > y.rank:
    __magic_name__    					=	x
  else:
    __magic_name__    					=	y
    if x.rank == y.rank:
      y.rank += 1

def a__   (	A_ ):






  '''simple docstring'''





  if x != x.parent:
    __magic_name__    					=	find_set(x.parent )
  return x.parent

def a__   (	A_ ):






  '''simple docstring'''





  __magic_name__    					=	({0, 1, 2}, {3, 4, 5})
  for s in sets:
    if node.data in s:
      return s
  __magic_name__    					=	f'''{node.data} is not in {sets}'''
  raise ValueError(A_ )

def a__   (	):






  '''simple docstring'''





  __magic_name__    					=	[Node(A_ ) for i in range(6 )]
  for v in vertex:
    make_set(A_ )

  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(A_ ).isdisjoint(find_python_set(A_ ) ):
        assert find_set(A_ ) != find_set(A_ )
      else:
        assert find_set(A_ ) == find_set(A_ )


if __name__ == "__main__":
    test_disjoint_set()



import sys

sys.set_int_max_str_digits(0)  # type: ignore

def a__   (	A_ ):






  '''simple docstring'''





  __magic_name__    					=	[0] * 11
  __magic_name__    					=	[0] * 11

  # mark last 9 numbers
  for _ in range(9 ):
    __magic_name__    					=	1
    __magic_name__    					=	number // 10
  # flag
  __magic_name__    					=	True

  # check last 9 numbers for pandigitality

  for x in range(9 ):
    if not check_last[x + 1]:
      __magic_name__    					=	False
  if not f:
    return f

  # mark first 9 numbers
  __magic_name__    					=	int(str(A_ )[:9] )

  for _ in range(9 ):
    __magic_name__    					=	1
    __magic_name__    					=	number // 10

  # check first 9 numbers for pandigitality

  for x in range(9 ):
    if not check_front[x + 1]:
      __magic_name__    					=	False
  return f

def a__   (	A_ ):






  '''simple docstring'''





  __magic_name__    					=	[0] * 11

  # mark last 9 numbers
  for _ in range(9 ):
    __magic_name__    					=	1
    __magic_name__    					=	number // 10
  # flag
  __magic_name__    					=	True

  # check last 9 numbers for pandigitality

  for x in range(9 ):
    if not check_last[x + 1]:
      __magic_name__    					=	False
  return f

def a__   (	):






  '''simple docstring'''





  __magic_name__    					=	1
  __magic_name__    					=	1
  __magic_name__    					=	2
  # temporary Fibonacci numbers

  __magic_name__    					=	1
  __magic_name__    					=	1
  __magic_name__    					=	2
  # temporary Fibonacci numbers mod 1e9

  # mod m=1e9, done for fast optimisation
  __magic_name__    					=	[0] * 1000000
  __magic_name__    					=	1000000000

  for x in range(1000000 ):
    __magic_name__    					=	(aa + ba) % m
    __magic_name__    					=	ba % m
    __magic_name__    					=	ca % m
    if checka(A_ ):
      __magic_name__    					=	1

  for x in range(1000000 ):
    __magic_name__    					=	a + b
    __magic_name__    					=	b
    __magic_name__    					=	c
    # perform check only if in tocheck
    if tocheck[x + 3] and check(A_ ):
      return x + 3  # first 2 already done
  return -1


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

