"""simple docstring"""




def 							SCREAMING_SNAKE_CASE  (    _lowerCamelCase		: Union[str, Any]			) ->   Any:  # noqa: E741
  _lowerCAmelCase		: Optional[int]						    =  len(_snake_case			)
  _lowerCAmelCase		: Tuple						    =  0
  _lowerCAmelCase		: Tuple						    =  [0] * n
  _lowerCAmelCase		: List[str]						    =  [False] * n
  _lowerCAmelCase		: Optional[Any]						    =  [False] * n

  def dfs(_lowerCamelCase		: str    ,_lowerCamelCase		: Optional[int]    ,_lowerCamelCase		: Tuple    ,_lowerCamelCase		: Tuple			):
    if parent == root:
      out_edge_count += 1
    _lowerCAmelCase		: Optional[int]						    =  True
    _lowerCAmelCase		: List[Any]						    =  at

    for to in l[at]:
      if to == parent:
        pass
      elif not visited[to]:
        _lowerCAmelCase		: int						    =  dfs(_snake_case    ,_snake_case    ,_snake_case    ,_snake_case			)
        _lowerCAmelCase		: List[Any]						    =  min(low[at]    ,low[to]			)

        # AP found via bridge
        if at < low[to]:
          _lowerCAmelCase		: Dict						    =  True
        # AP found via cycle
        if at == low[to]:
          _lowerCAmelCase		: List[Any]						    =  True
      else:
        _lowerCAmelCase		: int						    =  min(low[at]    ,_snake_case			)
    return out_edge_count

  for i in range(_snake_case			):
    if not visited[i]:
      _lowerCAmelCase		: Tuple						    =  0
      _lowerCAmelCase		: List[Any]						    =  dfs(_snake_case    ,_snake_case    ,-1    ,_snake_case			)
      _lowerCAmelCase		: Optional[Any]						    =  out_edge_count > 1

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


# Adjacency list of graph
_a   :	Tuple 					=     {
    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 							SCREAMING_SNAKE_CASE  (    _lowerCamelCase		: int			) ->   bool:
  return sum(i for i in range(1    ,number // 2 + 1			) if number % i == 0			) == number


if __name__ == "__main__":
     print('Program to check whether a number is a Perfect number or not...')
     _a   :	int 					=     int(input('Enter number: ').strip())
     print(F"""{number} is {"" if perfect(number) else "not "}a Perfect Number.""")




