



import math
import sys

class        _A			:



       def __init__(						self				:	Optional[Any]):


           '''simple docstring'''

           __a					=							0
           __a					=							[]
           __a					=							{}  # To store the pos of node in array



       def 						_lowerCamelCase     (						self				:	Any):


           '''simple docstring'''

           return self.cur_size == 0



       def 						_lowerCamelCase     (						self				:	Any	,						__SCREAMING_SNAKE_CASE				:	List[str]):


           '''simple docstring'''

           __a					=							self.left(__SCREAMING_SNAKE_CASE)
           __a					=							self.right(__SCREAMING_SNAKE_CASE)
           if lc < self.cur_size and self.array(__SCREAMING_SNAKE_CASE)[0] < self.array(__SCREAMING_SNAKE_CASE)[0]:
               __a					=							lc
           else:
               __a					=							idx
           if rc < self.cur_size and self.array(__SCREAMING_SNAKE_CASE)[0] < self.array(__SCREAMING_SNAKE_CASE)[0]:
               __a					=							rc
           if smallest != idx:
               self.swap(__SCREAMING_SNAKE_CASE	,						__SCREAMING_SNAKE_CASE)
               self.min_heapify(__SCREAMING_SNAKE_CASE)



       def 						_lowerCamelCase     (						self				:	Tuple	,						__SCREAMING_SNAKE_CASE				:	Optional[Any]):


           '''simple docstring'''

           __a					=							self.cur_size
           self.cur_size += 1
           self.array.append((sys.maxsize, tup[1]))
           self.decrease_key((sys.maxsize, tup[1])	,						tup[0])



       def 						_lowerCamelCase     (						self				:	Optional[Any]):


           '''simple docstring'''

           __a					=							self.array[0][1]
           __a					=							self.array[self.cur_size - 1]
           self.cur_size -= 1
           self.min_heapify(1)
           del self.pos[min_node]
           return min_node



       def 						_lowerCamelCase     (						self				:	str	,						__SCREAMING_SNAKE_CASE				:	Optional[int]):


           '''simple docstring'''

           return 2 * i + 1



       def 						_lowerCamelCase     (						self				:	Dict	,						__SCREAMING_SNAKE_CASE				:	List[str]):


           '''simple docstring'''

           return 2 * i + 2



       def 						_lowerCamelCase     (						self				:	Tuple	,						__SCREAMING_SNAKE_CASE				:	Optional[Any]):


           '''simple docstring'''

           return math.floor(i / 2)



       def 						_lowerCamelCase     (						self				:	Dict	,						__SCREAMING_SNAKE_CASE				:	Optional[Any]	,						__SCREAMING_SNAKE_CASE				:	Optional[Any]):


           '''simple docstring'''

           __a					=							j
           __a					=							i
           __a					=							self.array[i]
           __a					=							self.array[j]
           __a					=							temp





       def 						_lowerCamelCase     (						self				:	str	,						__SCREAMING_SNAKE_CASE				:	Any	,						__SCREAMING_SNAKE_CASE				:	str):


           '''simple docstring'''

           __a					=							self.pos[tup[1]]
           # assuming the new_d is atmost old_d
           __a					=							(new_d, tup[1])
           while idx > 0 and self.array[self.par(__SCREAMING_SNAKE_CASE)][0] > self.array[idx][0]:
               self.swap(__SCREAMING_SNAKE_CASE	,						self.par(__SCREAMING_SNAKE_CASE))
               __a					=							self.par(__SCREAMING_SNAKE_CASE)


class        _A			:



       def __init__(						self				:	Union[str, Any]	,						__SCREAMING_SNAKE_CASE				:	Dict):


           '''simple docstring'''

           __a					=							{}  # To store graph: u -> (v,w)
           __a					=							num  # Number of nodes in graph
           # To store the distance from source vertex
           __a					=							[0] * self.num_nodes
           __a					=							[-1] * self.num_nodes  # To store the path



       def 						_lowerCamelCase     (						self				:	str	,						__SCREAMING_SNAKE_CASE				:	Optional[Any]	,						__SCREAMING_SNAKE_CASE				:	Union[str, Any]	,						__SCREAMING_SNAKE_CASE				:	Dict):


           '''simple docstring'''

           if u in self.adjList:
               self.adjList[u].append((v, w))
           else:
               __a					=							[(v, w)]

           # Assuming undirected graph
           if v in self.adjList:
               self.adjList[v].append((u, w))
           else:
               __a					=							[(u, w)]



       def 						_lowerCamelCase     (						self				:	List[Any]):


           '''simple docstring'''

           for u in self.adjList:
               print(__SCREAMING_SNAKE_CASE	,						'''->'''	,						''' -> '''.join(str(F'{v}({w})') for v, w in self.adjList[u]))



       def 						_lowerCamelCase     (						self				:	Tuple	,						__SCREAMING_SNAKE_CASE				:	Optional[int]):


           '''simple docstring'''

           __a					=							[-1] * self.num_nodes
           # src is the source node
           __a					=							0
           __a					=							PriorityQueue()
           q.insert((0, src))  # (dist from src, node)
           for u in self.adjList:
               if u != src:
                   __a					=							sys.maxsize  # Infinity
                   __a					=							-1

           while not q.is_empty():
               __a					=							q.extract_min()  # Returns node with the min dist from source
               # Update the distance of all the neighbours of u and
               # if their prev dist was INFINITY then push them in Q
               for v, w in self.adjList[u]:
                   __a					=							self.dist[u] + w
                   if self.dist[v] > new_dist:
                       if self.dist[v] == sys.maxsize:
                           q.insert((new_dist, v))
                       else:
                           q.decrease_key((self.dist[v], v)	,						__SCREAMING_SNAKE_CASE)
                       __a					=							new_dist
                       __a					=							u

        # Show the shortest distances from src
           self.show_distances(__SCREAMING_SNAKE_CASE)



       def 						_lowerCamelCase     (						self				:	str	,						__SCREAMING_SNAKE_CASE				:	Union[str, Any]):


           '''simple docstring'''

           print(F'Distance from node: {src}')
           for u in range(self.num_nodes):
               print(F'Node {u} has distance: {self.dist[u]}')





       def 						_lowerCamelCase     (						self				:	List[str]	,						__SCREAMING_SNAKE_CASE				:	Dict	,						__SCREAMING_SNAKE_CASE				:	Optional[int]):


           '''simple docstring'''

           __a					=							[]
           __a					=							0
           __a					=							dest
           # Backtracking from dest to src
           while self.par[temp] != -1:
               path.append(__SCREAMING_SNAKE_CASE)
               if temp != src:
                   for v, w in self.adjList[temp]:
                       if v == self.par[temp]:
                           cost += w
                           break
               __a					=							self.par[temp]
           path.append(__SCREAMING_SNAKE_CASE)
           path.reverse()

           print(F'----Path to reach {dest} from {src}----')
           for u in path:
               print(F'{u}'	,						end=''' ''')
               if u != dest:
                   print('''-> '''	,						end='''''')

           print('''\nTotal cost of path: '''	,						__SCREAMING_SNAKE_CASE)


if __name__ == "__main__":
 __snake_case		:int 						=	Graph(9)
 graph.add_edge(0, 1, 4)
 graph.add_edge(0, 7, 8)
 graph.add_edge(1, 2, 8)
 graph.add_edge(1, 7, 11)
 graph.add_edge(2, 3, 7)
 graph.add_edge(2, 8, 2)
 graph.add_edge(2, 5, 4)
 graph.add_edge(3, 4, 9)
 graph.add_edge(3, 5, 14)
 graph.add_edge(4, 5, 10)
 graph.add_edge(5, 6, 2)
 graph.add_edge(6, 7, 1)
 graph.add_edge(6, 8, 6)
 graph.add_edge(7, 8, 7)
 graph.show_graph()
 graph.dijkstra(0)
 graph.show_path(0, 4)

# OUTPUT
# 0 -> 1(4) -> 7(8)
# 1 -> 0(4) -> 2(8) -> 7(11)
# 7 -> 0(8) -> 1(11) -> 6(1) -> 8(7)
# 2 -> 1(8) -> 3(7) -> 8(2) -> 5(4)
# 3 -> 2(7) -> 4(9) -> 5(14)
# 8 -> 2(2) -> 6(6) -> 7(7)
# 5 -> 2(4) -> 3(14) -> 4(10) -> 6(2)
# 4 -> 3(9) -> 5(10)
# 6 -> 5(2) -> 7(1) -> 8(6)
# Distance from node: 0
# Node 0 has distance: 0
# Node 1 has distance: 4
# Node 2 has distance: 12
# Node 3 has distance: 19
# Node 4 has distance: 21
# Node 5 has distance: 11
# Node 6 has distance: 9
# Node 7 has distance: 8
# Node 8 has distance: 14
# ----Path to reach 4 from 0----
# 0 -> 7 -> 6 -> 5 -> 4
# Total cost of path:  21










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





