
from math import floor, sqrt



def 			UpperCamelCase       (				lowerCAmelCase__						):
					'''simple docstring'''
					lowercase		      =		0.0
					lowercase		      =		1.0
					lowercase		      =		int(sqrt(lowerCAmelCase__						)						)
					lowercase		      =		root
					lowercase		      =		0
					while integer_part != 2 * root:
										lowercase		      =		denominator * integer_part - numerator
										lowercase		      =		(n - numerator**2) / denominator
										lowercase		      =		int((root + numerator) / denominator						)
										period += 1
					return period



def 			UpperCamelCase       (				lowerCAmelCase__ = 1_0000						):
					'''simple docstring'''
					lowercase		      =		0
					for i in range(2					,     n + 1						):
										lowercase		      =		sqrt(lowerCAmelCase__						)
										if sr - floor(lowerCAmelCase__						) != 0 and continuous_fraction_period(lowerCAmelCase__						) % 2 == 1:
															count_odd_periods += 1
					return count_odd_periods


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








import sys



def      __lowerCAmelCase    (				snake_case						:     int    ,   snake_case						:     list[int]			)							->				int:
   if not numbers:
      return 0
   if target == 0 and target in numbers:
      return 0
   if not isinstance(snake_case    ,   (list, tuple)			) or not all(
       isinstance(snake_case    ,   snake_case			) for number in numbers			):
      raise ValueError("""numbers must be an iterable of integers"""			)

   __lowerCamelCase:					Union[str, Any]	 =						0
   __lowerCamelCase:					str	 =						sys.maxsize

   while right < len(snake_case			):
      curr_sum += numbers[right]
      while curr_sum >= target and left <= right:
         __lowerCamelCase:					str	 =						min(snake_case    ,   right - left + 1			)
         curr_sum -= numbers[left]
         left += 1
      right += 1

   return 0 if min_len == sys.maxsize else min_len


