


from __future__ import annotations







def 						lowerCamelCase(   a__	,a__):
    _SCREAMING_SNAKE_CASE			  =[]
    create_all_state(1	,_lowerCAmelCase	,_lowerCAmelCase	,[]	,_lowerCAmelCase)
    return result







def 						lowerCamelCase(   a__	,a__	,a__	,a__	,a__	,):
    if level == 0:
        total_list.append(current_list[:])
        return

    for i in range(_lowerCAmelCase	,total_number - level + 2):
        current_list.append(_lowerCAmelCase)
        create_all_state(i + 1	,_lowerCAmelCase	,level - 1	,_lowerCAmelCase	,_lowerCAmelCase)
        current_list.pop()







def 						lowerCamelCase(   a__):
    for i in total_list:
        print(*_lowerCAmelCase)


if __name__ == "__main__":
       snake_case_						:			Tuple													=							4
       snake_case_						:			Any													=							2
       snake_case_						:			List[str]													=							generate_all_combinations(n, k)
       print_all_state(total_list)



from collections.abc import Generator







def 						lowerCamelCase(   ):
				_SCREAMING_SNAKE_CASE  ,				_SCREAMING_SNAKE_CASE			  =0, 1
				while True:
								_SCREAMING_SNAKE_CASE  ,				_SCREAMING_SNAKE_CASE			  =b, a + b
								yield b







def 						lowerCamelCase(   a__ = 1000):
				_SCREAMING_SNAKE_CASE			  =1
				_SCREAMING_SNAKE_CASE			  =fibonacci_generator()
				while len(str(next(a__))) < n:
								answer += 1
				return answer + 1


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