






"""simple docstring"""



def 		_SCREAMING_SNAKE_CASE					(       __snake_case     :    int       ):





  '''simple docstring'''





  if not isinstance(__snake_case						,   __snake_case       ):
    raise TypeError('recursive_lucas_number accepts only integer arguments.'       )
  if n_th_number == 0:
    return 2
  if n_th_number == 1:
    return 1

  return recursive_lucas_number(n_th_number - 1       ) + recursive_lucas_number(
      n_th_number - 2       )
def 		_SCREAMING_SNAKE_CASE					(       __snake_case     :    int       ):





  '''simple docstring'''





  if not isinstance(__snake_case						,   __snake_case       ):
    raise TypeError('dynamic_lucas_number accepts only integer arguments.'       )
  lowercase       ,	lowercase				       =			2, 1
  for _ in range(__snake_case       ):
    lowercase       ,	lowercase				       =			b, a + b
  return a


if __name__ == "__main__":
    from doctest import testmod

    testmod()
    _UpperCamelCase						:    Tuple		=						int(input('Enter the number of terms in lucas series:\n').strip())
    print('Using recursive function to calculate lucas series:')
    print(' '.join(str(recursive_lucas_number(i)) for i in range(n)))
    print('\nUsing dynamic function to calculate lucas series:')
    print(' '.join(str(dynamic_lucas_number(i)) for i in range(n)))






from math import floor, sqrt

def 		snake_case_   (				lowercase__     :    int     ):






				'''simple docstring'''






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

def 		snake_case_   (				lowercase__     :    int = 1_00_00     ):






				'''simple docstring'''






				_lowerCAmelCase  						=0
				for i in range(2       ,     n + 1     ):
								_lowerCAmelCase  						=sqrt(lowercase__     )
								if sr - floor(lowercase__     ) != 0 and continuous_fraction_period(lowercase__     ) % 2 == 1:
												count_odd_periods += 1
				return count_odd_periods


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

