
from collections import Counter
from functools import total_ordering

from data_structures.heap.heap import Heap






@total_ordering
class 							SCREAMING_SNAKE_CASE__     :

							"""simple docstring"""






							def __init__(	self  ,						SCREAMING_SNAKE_CASE_  ,						SCREAMING_SNAKE_CASE_      )-> None:





													'''simple docstring'''






													__UpperCamelCase  	=      word
													__UpperCamelCase  	=      count



							def __eq__(	self  ,						SCREAMING_SNAKE_CASE_      )-> bool:





													'''simple docstring'''






													if not isinstance(SCREAMING_SNAKE_CASE_  ,						SCREAMING_SNAKE_CASE_      ):
																			return NotImplemented
													return self.count == other.count



							def __lt__(	self  ,						SCREAMING_SNAKE_CASE_      )-> bool:





													'''simple docstring'''






													if not isinstance(SCREAMING_SNAKE_CASE_  ,						SCREAMING_SNAKE_CASE_      ):
																			return NotImplemented
													return self.count < other.count





def 						A_			(				snake_case				: list[str]			,   snake_case				: int			)   ->     list[str]:



						'''simple docstring'''

						__UpperCamelCase  	=      Heap()
						__UpperCamelCase  	=      Counter(snake_case			)
						heap.build_max_heap(
						    [WordCount(snake_case			,   snake_case			) for word, count in count_by_word.items()]			)
						return [heap.extract_max().word for _ in range(min(snake_case			,   len(snake_case			)			)			)]


if __name__ == "__main__":
				import doctest

				doctest.testmod()









from math import floor, sqrt





def 	__snake_case      (     _UpperCAmelCase							):
    __a					=							0.0
    __a					=							1.0
    __a					=							int(sqrt(_UpperCAmelCase							)							)
    __a					=							root
    __a					=							0
    while integer_part != 2 * root:
        __a					=							denominator * integer_part - numerator
        __a					=							(n - numerator**2) / denominator
        __a					=							int((root + numerator) / denominator							)
        period += 1
    return period





def 	__snake_case      (     _UpperCAmelCase = 10000							):
    __a					=							0
    for i in range(2  ,					n + 1							):
        __a					=							sqrt(_UpperCAmelCase							)
        if sr - floor(_UpperCAmelCase							) != 0 and continuous_fraction_period(_UpperCAmelCase							) % 2 == 1:
            count_odd_periods += 1
    return count_odd_periods


if __name__ == "__main__":
 print(f'{solution(int(input().strip()))}')





