


"""simple docstring"""






from __future__ import annotations

import unittest

from transformers import is_tf_available
from transformers.testing_utils import require_sentencepiece, require_tf, require_tokenizers, slow


if is_tf_available():
	import numpy as np
	import tensorflow as tf

	from transformers import TFXLMRobertaModel


@require_tf
@require_sentencepiece
@require_tokenizers
class 			lowerCamelCase_		(			unittest.TestCase   ):





				"""simple docstring"""







				@slow
				def   lowerCAmelCase__		(						self     ):
								SCREAMING_SNAKE_CASE__     							=				TFXLMRobertaModel.from_pretrained("jplu/tf-xlm-roberta-base"     )

								SCREAMING_SNAKE_CASE__     							=				{
								    "input_ids": tf.convert_to_tensor([[0, 2646, 1_0269, 83, 9_9942, 2]]       ,		dtype=tf.intaa     ),  # "My dog is cute"
								    "attention_mask": tf.convert_to_tensor([[1, 1, 1, 1, 1, 1]]       ,		dtype=tf.intaa     ),
								}

								SCREAMING_SNAKE_CASE__     							=				model(UpperCAmelCase__     )["last_hidden_state"]
								SCREAMING_SNAKE_CASE__     							=				tf.TensorShape((1, 6, 768)     )
								self.assertEqual(output.shape       ,		UpperCAmelCase__     )
								# compare the actual values for a slice.
								SCREAMING_SNAKE_CASE__     							=				tf.convert_to_tensor(
								    [
								        [
								            [0.0_681_762, 0.10_894_451, 0.06_772_504],
								            [-0.06_423_668, 0.02_366_615, 0.04_329_344],
								            [-0.06_057_295, 0.09_974_135, -0.00_070_584],
								        ]
								    ]       ,		dtype=tf.floataa       ,		)

								self.assertTrue(np.allclose(output[:, :3, :3].numpy()       ,		expected_slice.numpy()       ,		atol=1e-4     )     )




"""simple docstring"""






from math import sqrt


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


def __lowercase     (      lowerCamelCase_  :      int = 10000  ):
				SCREAMING_SNAKE_CASE__     							=				sum(
				    i
				    for i in range(1						,					lowerCamelCase_  )
				    if sum_of_divisors(sum_of_divisors(lowerCamelCase_  )  ) == i and sum_of_divisors(lowerCamelCase_  ) != i  )
				return total


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