'''simple docstring'''





# Copyright 2023 The HuggingFace Inc. 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 ..models.auto import AutoModelForSeqaSeqLM, AutoTokenizer
from .base import PipelineTool




class        __A      ( UpperCamelCase__	):
    a__       :						Optional[int]          =  """philschmid/bart-large-cnn-samsum"""
    a__       :						str          =  (
        """This is a tool that summarizes an English text. It takes an input `text` containing the text to summarize, """
        """and returns a summary of the text."""
    )
    a__       :						Optional[int]          =  """summarizer"""
    a__       :						str          =  AutoTokenizer
    a__       :						Optional[int]          =  AutoModelForSeqaSeqLM

    a__       :						Optional[int]          =  ["""text"""]
    a__       :						Optional[int]          =  ["""text"""]



    def 					_lowercase						(self    :    Dict   ,			__a    :    int ):
         return self.pre_processor(__a   ,			return_tensors="pt"   ,			truncation=__a )



    def 					_lowercase						(self    :    Optional[Any]   ,			__a    :    Optional[int] ):
         return self.model.generate(**__a )[0]






    def 					_lowercase						(self    :    List[str]   ,			__a    :    Any ):
         return self.pre_processor.decode(__a   ,			skip_special_tokens=__a   ,			clean_up_tokenization_spaces=__a )







"""simple docstring"""





from math import sqrt




def   _A  (  UpperCamelCase_     :       int)	->						int:
   '''simple docstring'''


   __lowercase								=						0
   for i in range(1,			int(sqrt(UpperCamelCase_) + 1)):
      if n % i == 0 and i != sqrt(UpperCamelCase_):
         total += i + n // i
      elif i == sqrt(UpperCamelCase_):
         total += i
   return total - n




def   _A  (  UpperCamelCase_     :       int = 10000)	->						int:
   '''simple docstring'''


   __lowercase								=						sum(
       i
       for i in range(1,			UpperCamelCase_)
       if sum_of_divisors(sum_of_divisors(UpperCamelCase_)) == i and sum_of_divisors(UpperCamelCase_) != i)
   return total


if __name__ == "__main__":
   print(solution(int(str(input()).strip())))




