





'''simple docstring'''



import unittest

from transformers import AutoTokenizer, is_flax_available
from transformers.testing_utils import require_flax, require_sentencepiece, require_tokenizers, slow


if is_flax_available():
	import jax.numpy as jnp

	from transformers import FlaxXLMRobertaModel






@require_sentencepiece
@require_tokenizers
@require_flax
class 							__lowercase    ( unittest.TestCase  ):







	'''simple docstring'''

	@slow
	def   _UpperCAmelCase       (self	)							->							Tuple:







				'''simple docstring'''





				__lowercase			  =							FlaxXLMRobertaModel.from_pretrained('''xlm-roberta-base'''	)
				__lowercase			  =							AutoTokenizer.from_pretrained('''xlm-roberta-base'''	)
				__lowercase			  =							'''The dog is cute and lives in the garden house'''
				__lowercase			  =							jnp.array([tokenizer.encode(_lowerCamelCase	)]	)

				__lowercase			  =							(1, 12, 768)  # batch_size, sequence_length, embedding_vector_dim
				__lowercase			  =							jnp.array(
				    [[-0.0_1_0_1, 0.1_2_1_8, -0.0_8_0_3, 0.0_8_0_1, 0.1_3_2_7, 0.0_7_7_6, -0.1_2_1_5, 0.2_3_8_3, 0.3_3_3_8, 0.3_1_0_6, 0.0_3_0_0, 0.0_2_5_2]]	)

				__lowercase			  =							model(_lowerCamelCase	)['''last_hidden_state''']
				self.assertEqual(output.shape       ,_lowerCamelCase	)
				# compare the actual values for a slice of last dim
				self.assertTrue(jnp.allclose(output[:, :, -1]       ,_lowerCamelCase       ,atol=1E-3	)	)












'''simple docstring'''



from math import sqrt




def 				_lowerCAmelCase  (			lowerCamelCase_     :					int			):
			__lowercase			  =							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 				_lowerCAmelCase  (			lowerCamelCase_     :					int = 1_0_0_0_0			):
			__lowercase			  =							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())))





