



"""simple docstring"""







from math import floor, sqrt



def   a_	(			__a      ):
     A__				=   0.0
     A__				=   1.0
     A__				=   int(sqrt(__a      )      )
     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   a_	(			__a = 1_0000      ):
     A__				=   0
     for i in range(2		,							n + 1      ):
          A__				=   sqrt(__a      )
          if sr - floor(__a      ) != 0 and continuous_fraction_period(__a      ) % 2 == 1:
               count_odd_periods += 1
     return count_odd_periods


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










"""simple docstring"""







from math import factorial



def   a_	(			__a		,							__a      ):
     return factorial(__a      ) / (factorial(__a      ) * factorial(n - r      ))



def   a_	(			):
     A__				=   0

     for i in range(1		,							101      ):
          for j in range(1		,							i + 1      ):
               if combinations(__a		,							__a      ) > 1e6:
                    total += 1
     return total


if __name__ == "__main__":
 print(solution())



