




'''simple docstring'''



from __future__ import annotations
def 			SCREAMING_SNAKE_CASE_			(							__A    :			list[int]	,					__A    :			int  )			->			list[list[int]]:
			_SCREAMING_SNAKE_CASE	=				[]
			_SCREAMING_SNAKE_CASE	=				[]
			_SCREAMING_SNAKE_CASE	=				0
			_SCREAMING_SNAKE_CASE	=				sum(__A  )
			create_state_space_tree(__A	,					__A	,					__A	,					__A	,					__A	,					__A  )
			return result
def 			SCREAMING_SNAKE_CASE_			(							__A    :			list[int]	,					__A    :			int	,					__A    :			int	,					__A    :			list[int]	,					__A    :			list[list[int]]	,					__A    :			int	,					)			->			None:
			if sum(__A  ) > max_sum or (remaining_nums_sum + sum(__A  )) < max_sum:
						return
			if sum(__A  ) == max_sum:
						result.append(__A  )
						return
			for index in range(__A	,					len(__A  )  ):
						create_state_space_tree(
						    __A	,					__A	,					index + 1	,					[*path, nums[index]]	,					__A	,					remaining_nums_sum - nums[index]	,					)
lowerCamelCase_			=						[3, 34, 4, 12, 5, 2]
lowerCamelCase_			=						9
lowerCamelCase_			=						generate_sum_of_subsets_soln(nums, max_sum)






print(*result)







'''simple docstring'''



def 			SCREAMING_SNAKE_CASE_			(							__A    :			int  )			->			int:
   if n == 1 or not isinstance(__A	,					__A  ):
      return 0
   elif n == 2:
      return 1
   else:
      _SCREAMING_SNAKE_CASE	=				[0, 1]
      for i in range(2	,					n + 1  ):
         sequence.append(sequence[i - 1] + sequence[i - 2]  )

      return sequence[n]
def 			SCREAMING_SNAKE_CASE_			(							__A    :			int  )			->			int:
   _SCREAMING_SNAKE_CASE	=				0
   _SCREAMING_SNAKE_CASE	=				2

   while digits < n:
      index += 1
      _SCREAMING_SNAKE_CASE	=				len(str(fibonacci(__A  )  )  )

   return index
def 			SCREAMING_SNAKE_CASE_			(							__A    :			int = 10_00  )			->			int:
   return fibonacci_digits_index(__A  )


if __name__ == "__main__":
 print(solution(int(str(input()).strip())))

