


"""simple docstring"""







# Copyright 2021 The HuggingFace Team. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.

from argparse import ArgumentParser

from accelerate.commands.config import get_config_parser
from accelerate.commands.env import env_command_parser
from accelerate.commands.launch import launch_command_parser
from accelerate.commands.test import test_command_parser
from accelerate.commands.tpu import tpu_command_parser
def _A						(						):







    """simple docstring"""
    a 		=ArgumentParser('''Accelerate CLI tool'''       ,    usage='''accelerate <command> [<args>]'''       ,    allow_abbrev=lowercase		)
    a 		=parser.add_subparsers(help='''accelerate command helpers'''		)

    # Register commands
    get_config_parser(subparsers=lowercase		)
    env_command_parser(subparsers=lowercase		)
    launch_command_parser(subparsers=lowercase		)
    tpu_command_parser(subparsers=lowercase		)
    test_command_parser(subparsers=lowercase		)

    # Let's go
    a 		=parser.parse_args()

    if not hasattr(lowercase       ,    '''func'''		):
        parser.print_help()
        exit(1		)

    # Run
    args.func(lowercase		)


if __name__ == "__main__":
       main()
'''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())






