'''simple docstring'''




def __lowerCAmelCase					(				UpperCamelCase__							)      ->       Any:





    if len(A_							) <= 1:
        return [tuple(A_							)]

    __lowerCamelCase            =    []

    def generate(UpperCamelCase__							,    UpperCamelCase__							):
        __lowerCamelCase            =    [0] * n
        res.append(tuple(A_							)							)

        __lowerCamelCase            =    0
        while i < n:
            if c[i] < i:
                if i % 2 == 0:
                    __lowerCamelCase      ,    __lowerCamelCase            =    arr[i], arr[0]
                else:
                    __lowerCamelCase      ,    __lowerCamelCase            =    arr[i], arr[c[i]]
                res.append(tuple(A_							)							)
                c[i] += 1
                __lowerCamelCase            =    0
            else:
                __lowerCamelCase            =    0
                i += 1

    generate(len(A_							)							,    A_							)
    return res


if __name__ == "__main__":
  __UpperCAmelCase					=input("Enter numbers separated by a comma:\n").strip()
  __UpperCAmelCase					=[int(item) for item in user_input.split(",")]
  print(heaps(arr))


def a__       (			A_=28123   ):






  '''simple docstring'''





  __magic_name__								=			[1] * (limit + 1)

  for i in range(2,	int(limit**0.5   ) + 1   ):
    sum_divs[i * i] += i
    for k in range(i + 1,	limit // i + 1   ):
      sum_divs[k * i] += k + i

  __magic_name__								=			set()
  __magic_name__								=			0

  for n in range(1,	limit + 1   ):
    if sum_divs[n] > n:
      abundants.add(A_   )

    if not any((n - a in abundants) for a in abundants   ):
      res += n

  return res


if __name__ == "__main__":
    print(solution())

