





__A       :					Dict     					=     {0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5, 6], 5: [4, 6], 6: [4, 5]}

__A       :					Optional[int]     					=     {0: [1, 2, 3], 1: [0, 3], 2: [0], 3: [0, 1], 4: [], 5: []}





def 		__SCREAMING_SNAKE_CASE						(       UpperCamelCase__    ,    UpperCamelCase__    ,    UpperCamelCase__				)						->       list:







			'''simple docstring'''

			UpperCAmelCase     	=       True
			UpperCAmelCase     	=       []

			for neighbour in graph[vert]:
						if not visited[neighbour]:
									connected_verts += dfs(_UpperCamelCase    ,    _UpperCamelCase    ,    _UpperCamelCase				)

			return [vert, *connected_verts]





def 		__SCREAMING_SNAKE_CASE						(       UpperCamelCase__				)						->       list:







			'''simple docstring'''

			UpperCAmelCase     	=       len(_UpperCamelCase				)
			UpperCAmelCase     	=       graph_size * [False]
			UpperCAmelCase     	=       []

			for i in range(_UpperCamelCase				):
						if not visited[i]:
									UpperCAmelCase     	=       dfs(_UpperCamelCase    ,    _UpperCamelCase    ,    _UpperCamelCase				)
									components_list.append(_UpperCamelCase				)

			return components_list


if __name__ == "__main__":
				import doctest

				doctest.testmod()









from math import floor, sqrt





def 		__SCREAMING_SNAKE_CASE						(       UpperCamelCase__				)						->       int:







			'''simple docstring'''

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





def 		__SCREAMING_SNAKE_CASE						(       UpperCamelCase__ = 1_0000				)						->       int:







			'''simple docstring'''

			UpperCAmelCase     	=       0
			for i in range(2    ,    n + 1				):
						UpperCAmelCase     	=       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()))}')



