code: 
  """simple docstring"""
  
  
  
  
  
  
  
  import random
  def 			__UpperCAmelCase		(		a_			:		Optional[int]				)     ->       List[str]:
  
     def is_sorted(a_			:		int				):
        for i in range(len(a_				) - 1				):
           if collection[i] > collection[i + 1]:
              return False
        return True
  
     while not is_sorted(a_				):
        random.shuffle(a_				)
     return collection
  
  
  if __name__ == "__main__":
    SCREAMING_SNAKE_CASE_     				=   input('Enter numbers separated by a comma:\n').strip()
    SCREAMING_SNAKE_CASE_     				=   [int(item) for item in user_input.split(',')]
    print(bogo_sort(unsorted))
  
  
style_context: 
  """simple docstring"""
  
  
  
  
  
  
  
  from math import floor, sqrt
  def 			__UpperCAmelCase		(		a_			:		int				)     ->       int:
     _UpperCAmelCase   	=					0.0
     _UpperCAmelCase   	=					1.0
     _UpperCAmelCase   	=					int(sqrt(a_				)				)
     _UpperCAmelCase   	=					root
     _UpperCAmelCase   	=					0
     while integer_part != 2 * root:
        _UpperCAmelCase   	=					denominator * integer_part - numerator
        _UpperCAmelCase   	=					(n - numerator**2) / denominator
        _UpperCAmelCase   	=					int((root + numerator) / denominator				)
        period += 1
     return period
  def 			__UpperCAmelCase		(		a_			:		int = 1_00_00				)     ->       int:
     _UpperCAmelCase   	=					0
     for i in range(2    ,  n + 1				):
        _UpperCAmelCase   	=					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()))}''')
  
  