




"""simple docstring"""

import unittest

from transformers import BarthezTokenizer, BarthezTokenizerFast, BatchEncoding
from transformers.testing_utils import require_sentencepiece, require_tokenizers, require_torch, slow

from ...test_tokenization_common import TokenizerTesterMixin





@require_tokenizers
@require_sentencepiece
@slow  # see https://github.com/huggingface/transformers/issues/11457
class 				lowercase_       (     __lowerCAmelCase			,	unittest.TestCase							):



 '''simple docstring'''
 UpperCAmelCase    :     List[Any]        =	BarthezTokenizer
 UpperCAmelCase    :     Optional[Any]        =	BarthezTokenizerFast
 UpperCAmelCase    :     str        =	True
 UpperCAmelCase    :     Optional[int]        =	True

 def 			lowerCAmelCase_							( self       :       Union[str, Any]		):
       super().setUp()

       _A					   =   BarthezTokenizerFast.from_pretrained('moussaKam/mbarthez'		)
       tokenizer.save_pretrained(self.tmpdirname		)
       tokenizer.save_pretrained(self.tmpdirname    ,							legacy_format=UpperCAmelCase__		)
       _A					   =   tokenizer

 def 			lowerCAmelCase_							( self       :       int		):
       _A					   =   '<pad>'
       _A					   =   1

       self.assertEqual(self.get_tokenizer()._convert_token_to_id(UpperCAmelCase__		)    ,							UpperCAmelCase__		)
       self.assertEqual(self.get_tokenizer()._convert_id_to_token(UpperCAmelCase__		)    ,							UpperCAmelCase__		)

 def 			lowerCAmelCase_							( self       :       str		):
       _A					   =   list(self.get_tokenizer().get_vocab().keys()		)

       self.assertEqual(vocab_keys[0]    ,							'<s>'		)
       self.assertEqual(vocab_keys[1]    ,							'<pad>'		)
       self.assertEqual(vocab_keys[-1]    ,							'<mask>'		)
       self.assertEqual(len(UpperCAmelCase__		)    ,							101_122		)

 def 			lowerCAmelCase_							( self       :       Optional[Any]		):
       self.assertEqual(self.get_tokenizer().vocab_size    ,							101_122		)

 @require_torch
 def 			lowerCAmelCase_							( self       :       int		):
       _A					   =   ['A long paragraph for summarization.', 'Another paragraph for summarization.']
       _A					   =   [0, 57, 3_018, 70_307, 91, 2]

       _A					   =   self.tokenizer(
           UpperCAmelCase__    ,							max_length=len(UpperCAmelCase__		)    ,							padding=UpperCAmelCase__    ,							truncation=UpperCAmelCase__    ,							return_tensors='pt'		)
       self.assertIsInstance(UpperCAmelCase__    ,							UpperCAmelCase__		)

       self.assertEqual((2, 6)    ,							batch.input_ids.shape		)
       self.assertEqual((2, 6)    ,							batch.attention_mask.shape		)
       _A					   =   batch.input_ids.tolist()[0]
       self.assertListEqual(UpperCAmelCase__    ,							UpperCAmelCase__		)

 def 			lowerCAmelCase_							( self       :       Optional[Any]		):
       if not self.test_rust_tokenizer:
             return

       _A					   =   self.get_tokenizer()
       _A					   =   self.get_rust_tokenizer()

       _A					   =   'I was born in 92000, and this is falsé.'

       _A					   =   tokenizer.tokenize(UpperCAmelCase__		)
       _A					   =   rust_tokenizer.tokenize(UpperCAmelCase__		)
       self.assertListEqual(UpperCAmelCase__    ,							UpperCAmelCase__		)

       _A					   =   tokenizer.encode(UpperCAmelCase__    ,							add_special_tokens=UpperCAmelCase__		)
       _A					   =   rust_tokenizer.encode(UpperCAmelCase__    ,							add_special_tokens=UpperCAmelCase__		)
       self.assertListEqual(UpperCAmelCase__    ,							UpperCAmelCase__		)

       _A					   =   self.get_rust_tokenizer()
       _A					   =   tokenizer.encode(UpperCAmelCase__		)
       _A					   =   rust_tokenizer.encode(UpperCAmelCase__		)
       self.assertListEqual(UpperCAmelCase__    ,							UpperCAmelCase__		)



 @slow
 def 			lowerCAmelCase_							( self       :       Union[str, Any]		):
       # fmt: off
       _A					   =   {'input_ids': [[0, 490, 14_328, 4_507, 354, 47, 43_669, 95, 25, 78_117, 20_215, 19_779, 190, 22, 400, 4, 35_343, 80_310, 603, 86, 24_937, 105, 33_438, 94_762, 196, 39_642, 7, 15, 15_933, 173, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 10_534, 87, 25, 66, 3_358, 196, 55_289, 8, 82_961, 81, 2_204, 75_203, 7, 15, 763, 12_956, 216, 178, 14_328, 9_595, 1_377, 69_693, 7, 448, 71_021, 196, 18_106, 1_437, 13_974, 108, 9_083, 4, 49_315, 7, 39, 86, 1_326, 2_793, 46_333, 4, 448, 196, 74_588, 7, 49_315, 7, 39, 21, 822, 38_470, 74, 21, 66_723, 62_480, 8, 22_050, 5, 2]], 'attention_mask': [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]}  # noqa: E501
       # fmt: on

       # moussaKam/mbarthez is a french model. So we also use french texts.
       _A					   =   [
           'Le transformeur est un modèle d\'apprentissage profond introduit en 2017, '
           'utilisé principalement dans le domaine du traitement automatique des langues (TAL).',
           'À l\'instar des réseaux de neurones récurrents (RNN), les transformeurs sont conçus '
           'pour gérer des données séquentielles, telles que le langage naturel, pour des tâches '
           'telles que la traduction et la synthèse de texte.',
       ]

       self.tokenizer_integration_test_util(
           expected_encoding=UpperCAmelCase__    ,							model_name='moussaKam/mbarthez'    ,							revision='c2e4ecbca5e3cd2c37fe1ac285ca4fbdf1366fb6'    ,							sequences=UpperCAmelCase__    ,							)




"""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())))




