
from queue import Queue

def a__   (	A_ ):






  '''simple docstring'''





  __magic_name__    					=	Queue()
  __magic_name__    					=	[False] * len(UpperCamelCase_ )
  __magic_name__    					=	[-1] * len(UpperCamelCase_ )

  def bfs():
    while not queue.empty():
      __magic_name__    					=	queue.get()
      __magic_name__    					=	True

      for neighbour in graph[u]:
        if neighbour == u:
          return False

        if color[neighbour] == -1:
          __magic_name__    					=	1 - color[u]
          queue.put(UpperCamelCase_ )

        elif color[neighbour] == color[u]:
          return False

    return True

  for i in range(len(UpperCamelCase_ ) ):
    if not visited[i]:
      queue.put(UpperCamelCase_ )
      __magic_name__    					=	0
      if bfs() is False:
        return False

  return True


if __name__ == "__main__":
    # Adjacency List of graph
    print(check_bipartite({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2]}))



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() = }''')

