


from collections import defaultdict



def 							UpperCamelCase_( lowerCamelCase_				,					lowerCamelCase_					)       ->		bool:
    _lowercase			:				Any 						=						first_str.lower().strip()
    _lowercase			:				List[str] 						=						second_str.lower().strip()

    # Remove whitespace
    _lowercase			:				str 						=						first_str.replace(' '				,					''					)
    _lowercase			:				List[Any] 						=						second_str.replace(' '				,					''					)

    # Strings of different lengths are not anagrams
    if len(lowerCamelCase_					) != len(lowerCamelCase_					):
        return False

    # Default values for count should be 0
    _lowercase			:				defaultdict[str, int] 						=						defaultdict(lowerCamelCase_					)

    # For each character in input strings,
    # increment count in the corresponding
    for i in range(len(lowerCamelCase_					)					):
        count[first_str[i]] += 1
        count[second_str[i]] -= 1

    return all(_count == 0 for _count in count.values()					)


if __name__ == "__main__":
 from doctest import testmod

 testmod()
 SCREAMING_SNAKE_CASE			: List[Any]				   =					input("Enter the first string ").strip()
 SCREAMING_SNAKE_CASE			: Any				   =					input("Enter the second string ").strip()

 SCREAMING_SNAKE_CASE			: int				   =					check_anagrams(input_a, input_b)
 print(F"{input_a} and {input_b} are {'' if status else 'not '}anagrams.")






def 							UpperCamelCase_( lowerCamelCase_					)       ->		int:
    if n == 1 or not isinstance(lowerCamelCase_				,					lowerCamelCase_					):
        return 0
    elif n == 2:
        return 1
    else:
        _lowercase			:				List[str] 						=						[0, 1]
        for i in range(2				,					n + 1					):
            sequence.append(sequence[i - 1] + sequence[i - 2]					)

        return sequence[n]



def 							UpperCamelCase_( lowerCamelCase_					)       ->		int:
    _lowercase			:				Tuple 						=						0
    _lowercase			:				List[str] 						=						2

    while digits < n:
        index += 1
        _lowercase			:				Optional[int] 						=						len(str(fibonacci(lowerCamelCase_					)					)					)

    return index



def 							UpperCamelCase_( lowerCamelCase_ = 1000					)       ->		int:
    return fibonacci_digits_index(lowerCamelCase_					)


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


