

from math import floor, sqrt

def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					int    ):



     '''simple docstring'''





     lowercase__					:     Dict   = 0.0
     lowercase__					:     Tuple   = 1.0
     lowercase__					:     Tuple   = int(sqrt(SCREAMING_SNAKE_CASE_    )    )
     lowercase__					:     List[str]   = root
     lowercase__					:     str   = 0
     while integer_part != 2 * root:
          lowercase__					:     Tuple   = denominator * integer_part - numerator
          lowercase__					:     Optional[Any]   = (n - numerator**2) / denominator
          lowercase__					:     List[Any]   = int((root + numerator) / denominator    )
          period += 1
     return period

def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					int = 10_000    ):



     '''simple docstring'''





     lowercase__					:     str   = 0
     for i in range(2			,  n + 1    ):
          lowercase__					:     Optional[int]   = sqrt(SCREAMING_SNAKE_CASE_    )
          if sr - floor(SCREAMING_SNAKE_CASE_    ) != 0 and continuous_fraction_period(SCREAMING_SNAKE_CASE_    ) % 2 == 1:
               count_odd_periods += 1
     return count_odd_periods


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




from __future__ import annotations


class    SCREAMING_SNAKE_CASE__      :





    def __init__(   self		,     a = 0):
         lowercase__					:     int   = value
         lowercase__					:     Node | None   = None
         lowercase__					:     Node | None   = None



def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					Node | None			,  SCREAMING_SNAKE_CASE_	:					Node | None    ):



     '''simple docstring'''





     if treea is None:
          return treea
     if treea is None:
          return treea

     lowercase__					:     Optional[Any]   = treea.value + treea.value
     lowercase__					:     Union[str, Any]   = merge_two_binary_trees(treea.left			,  treea.left    )
     lowercase__					:     Optional[Any]   = merge_two_binary_trees(treea.right			,  treea.right    )
     return treea

def 			snake_case__    (					SCREAMING_SNAKE_CASE_	:					Node | None    ):



     '''simple docstring'''





     if root:
          print(root.value    )
          print_preorder(root.left    )
          print_preorder(root.right    )


if __name__ == "__main__":
       snake_case_    						=				Node(1)
       snake_case_    						=				Node(2)
       snake_case_    						=				Node(3)
       snake_case_    						=				Node(4)

       snake_case_    						=				Node(2)
       snake_case_    						=				Node(4)
       snake_case_    						=				Node(6)
       snake_case_    						=				Node(9)
       snake_case_    						=				Node(5)

       print('''Tree1 is: ''')
       print_preorder(treea)
       print('''Tree2 is: ''')
       print_preorder(treea)
       snake_case_    						=				merge_two_binary_trees(treea, treea)
       print('''Merged Tree is: ''')
       print_preorder(merged_tree)

