

'''simple docstring'''






def 	_A  (					A__   ):  # noqa: E741
 __lowercase													=				len(A__   )
 __lowercase													=				0
 __lowercase													=				[0] * n
 __lowercase													=				[False] * n
 __lowercase													=				[False] * n

 def dfs(A__  ,       A__  ,       A__  ,       A__   ):
  if parent == root:
   out_edge_count += 1
  __lowercase													=				True
  __lowercase													=				at

  for to in l[at]:
   if to == parent:
    pass
   elif not visited[to]:
    __lowercase													=				dfs(A__  ,       A__  ,       A__  ,       A__   )
    __lowercase													=				min(low[at]  ,       low[to]   )

    # AP found via bridge
    if at < low[to]:
     __lowercase													=				True
    # AP found via cycle
    if at == low[to]:
     __lowercase													=				True
   else:
    __lowercase													=				min(low[at]  ,       A__   )
  return out_edge_count

 for i in range(A__   ):
  if not visited[i]:
   __lowercase													=				0
   __lowercase													=				dfs(A__  ,       A__  ,       -1  ,       A__   )
   __lowercase													=				out_edge_count > 1

 for x in range(len(A__   )   ):
  if is_art[x] is True:
   print(A__   )


# Adjacency list of graph
lowerCAmelCase__      		=			{
    0: [1, 2],
    1: [0, 2],
    2: [0, 1, 3, 5],
    3: [2, 4],
    4: [3],
    5: [2, 6, 8],
    6: [5, 7],
    7: [6, 8],
    8: [5, 7],
}






compute_ap(data)




'''simple docstring'''






def 	_A  (					A__ = 1000000   ):






 """simple docstring"""



 __lowercase													=				set(range(3  ,       A__  ,       2   )   )
 primes.add(2   )
 for p in range(3  ,       A__  ,       2   ):
  if p not in primes:
   continue
  primes.difference_update(set(range(p * p  ,       A__  ,       A__   )   )   )

 __lowercase													=				[float(A__   ) for n in range(limit + 1   )]

 for p in primes:
  for n in range(A__  ,       limit + 1  ,       A__   ):
   phi[n] *= 1 - 1 / p

 return int(sum(phi[2:]   )   )


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

