



def 	__snake_case      (     _UpperCAmelCase  ,					_UpperCAmelCase							):
    if not root or root not in binary_tree_mirror_dictionary:
        return
    __a			,  __a					=							binary_tree_mirror_dictionary[root][:2]
    __a					=							[right_child, left_child]
    binary_tree_mirror_dict(_UpperCAmelCase  ,					_UpperCAmelCase							)
    binary_tree_mirror_dict(_UpperCAmelCase  ,					_UpperCAmelCase							)





def 	__snake_case      (     _UpperCAmelCase  ,					_UpperCAmelCase = 1							):
    if not binary_tree:
        raise ValueError('''binary tree cannot be empty'''							)
    if root not in binary_tree:
        __a					=							f'root {root} is not present in the binary_tree'
        raise ValueError(_UpperCAmelCase							)
    __a					=							dict(_UpperCAmelCase							)
    binary_tree_mirror_dict(_UpperCAmelCase  ,					_UpperCAmelCase							)
    return binary_tree_mirror_dictionary


if __name__ == "__main__":
 __snake_case		:Optional[Any] 						=	{1: [2, 3], 2: [4, 5], 3: [6, 7], 7: [8, 9]}
 print(f'Binary tree: {binary_tree}')
 __snake_case		:Dict 						=	binary_tree_mirror(binary_tree, 5)
 print(f'Binary tree mirror: {binary_tree_mirror_dictionary}')










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()))}')





