
from math import ceil




def 							__SCREAMING_SNAKE_CASE   (		SCREAMING_SNAKE_CASE       :      str    ,							SCREAMING_SNAKE_CASE       :      Dict			)     ->						int:
				__lowercase								=					list(range(0    ,							snake_case_			)			)

				__lowercase								=					[item for sublist in list(device_map.values()			) for item in sublist]

				# Duplicate check
				__lowercase								=					[]
				for i in device_map_blocks:
								if device_map_blocks.count(snake_case_			) > 1 and i not in duplicate_blocks:
												duplicate_blocks.append(snake_case_			)
												 # Missing blocks
				__lowercase								=					[i for i in blocks if i not in device_map_blocks]
				__lowercase								=					[i for i in device_map_blocks if i not in blocks]

				if len(snake_case_			) != 0:
								raise ValueError(
								    'Duplicate attention blocks specified in device_map. Attention blocks must be specified to one device.'
								    ' These attention blocks were specified more than once: ' + str(snake_case_			)			)
				if len(snake_case_			) != 0:
								raise ValueError(
								    'There are attention blocks for this model that are not specified in the device_map. Add these attention '
								    'blocks to a device on the device_map: ' + str(snake_case_			)			)
				if len(snake_case_			) != 0:
								raise ValueError(
								    'The device_map contains more attention blocks than this model has. Remove these from the device_map:'
								    + str(snake_case_			)			)




def 							__SCREAMING_SNAKE_CASE   (		SCREAMING_SNAKE_CASE       :      Tuple    ,							SCREAMING_SNAKE_CASE       :      List[str]			)     ->						Dict:
				__lowercase								=					list(range(snake_case_			)			)
				__lowercase								=					int(ceil(n_layers / len(snake_case_			)			)			)
				__lowercase								=					[layers[i : i + n_blocks] for i in range(0    ,							snake_case_    ,							snake_case_			)]

				return dict(zip(snake_case_    ,							snake_case_			)			)






'''simple docstring'''

def      UpperCamelCase_						(					snake_case_       :       Union[str, Any]=2_81_23      )					->     str:






 '''simple docstring'''

 __lowerCAmelCase											=						[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

 __lowerCAmelCase											=						set()
 __lowerCAmelCase											=						0

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

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

 return res


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






