

'''simple docstring'''







from __future__ import annotations
def       UpperCAmelCase__    (      UpperCAmelCase__,       UpperCAmelCase__				)			->			list[str]:
       if partitions <= 0:
              raise ValueError("""partitions must be a positive number!"""				)
       if partitions > number_of_bytes:
              raise ValueError("""partitions can not > number_of_bytes!"""				)
       A_						=      number_of_bytes // partitions
       A_						=      []
       for i in range(UpperCAmelCase__				):
              A_						=      i * bytes_per_partition + 1
              A_						=      (
                  number_of_bytes if i == partitions - 1 else (i + 1) * bytes_per_partition
              )
              allocation_list.append(F'''{start_bytes}-{end_bytes}'''				)
       return allocation_list


if __name__ == "__main__":
      import doctest

      doctest.testmod()



'''simple docstring'''







def       UpperCAmelCase__    (      UpperCAmelCase__				)			->			bool:
       return str(UpperCAmelCase__				) == str(UpperCAmelCase__				)[::-1]
def       UpperCAmelCase__    (      UpperCAmelCase__				)			->			int:
       return int(UpperCAmelCase__				) + int(str(UpperCAmelCase__				)[::-1]				)
def       UpperCAmelCase__    (      UpperCAmelCase__ = 1_00_00				)			->			int:
       A_						=      []
       for num in range(1,       UpperCAmelCase__				):
              A_						=      0
              A_						=      num
              while iterations < 50:
                     A_						=      sum_reverse(UpperCAmelCase__				)
                     iterations += 1
                     if is_palindrome(UpperCAmelCase__				):
                            break
              else:
                     lychrel_nums.append(UpperCAmelCase__				)
       return len(UpperCAmelCase__				)


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