



'''simple docstring'''
def A__    (     UpperCAmelCase_							):
						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...')
					snake_case_ :	Tuple         =  int(input('Enter number: ').strip())
					print(F"""{number} is {'' if perfect(number) else 'not '}a Perfect Number.""")






from collections import defaultdict

def       lowercase_		(		_A			:    int						):

      """simple docstring"""




      lowerCamelCase__		:				Union[str, Any]    =  1
      lowerCamelCase__		:				Dict    =  True
      for v in tree[start]:
            if v not in visited:
                  ret += dfs(_A						)
      if ret % 2 == 0:
            cuts.append(_A						)
      return ret

def       lowercase_		(		):

      """simple docstring"""




      dfs(1						)


if __name__ == "__main__":
    A,  A      :    Tuple		=					10, 9
    A      :    int		=					defaultdict(list)
    A      :    dict[int, bool]		=					{}
    A      :    list[int]		=					[]
    A      :    List[str]		=					0
    A      :    Tuple		=					[(2, 1), (3, 1), (4, 3), (5, 2), (6, 1), (7, 2), (8, 6), (9, 8), (10, 8)]
    for u, v in edges:
        tree[u].append(v)
        tree[v].append(u)
    even_tree()
    print(len(cuts) - 1)


