



from collections.abc import Generator





def 							A	(     )				-> Generator[int, None, None]:







			'''simple docstring'''
			_UpperCAmelCase       ,     _UpperCAmelCase		       =   0, 1
			while True:
						_UpperCAmelCase       ,     _UpperCAmelCase		       =   b, a + b
						yield b





def 							A	(     _UpperCAmelCase				:   List[str] = 1_000    )				-> int:







			'''simple docstring'''
			_UpperCAmelCase		       =   1
			_UpperCAmelCase		       =   fibonacci_generator()
			while len(str(next(a__    )    )    ) < n:
						answer += 1
			return answer + 1


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


from __future__ import annotations

import typing
from collections import Counter


def     __lowerCAmelCase			(			a__  )       ->  typing.Counter[int]:
				__a										=    Counter()
				for base in range(1						,    max_perimeter + 1  ):
								for perpendicular in range(a__						,    max_perimeter + 1  ):
												__a										=    (base * base + perpendicular * perpendicular) ** 0.5
												if hypotenuse == int(a__  ):
																__a										=    int(base + perpendicular + hypotenuse  )
																if perimeter > max_perimeter:
																				continue
																triplets[perimeter] += 1
				return triplets


def     __lowerCAmelCase			(			a__ = 1000  )       ->  int:
				__a										=    pythagorean_triple(a__  )
				return triplets.most_common(1  )[0][0]


if __name__ == "__main__":
					print(F"Perimeter {solution()} has maximum solutions")