




'''simple docstring'''







def 						snake_case_							(_a	:							int = 1_0_0     ):
    UpperCAmelCase			       =		set()

    UpperCAmelCase			       =		0

    UpperCAmelCase			       =		n + 1  # maximum limit

    for a in range(2    ,   _a     ):
        for b in range(2    ,   _a     ):
            UpperCAmelCase			       =		a**b  # calculates the current power
            collect_powers.add(_a     )  # adds the result to the set
    return len(_a     )


if __name__ == "__main__":
   print('Number of terms ', solution(int(str(input()).strip())))








'''simple docstring'''
def 					a__       (					lowerCAmelCase__						)    ->	int:
    UpperCAmelCase__			:		Tuple													=				0
    while num > 0:
        digit_sum += num % 10
        num //= 10
    return digit_sum





def 					a__       (					lowerCAmelCase__ = 1_00						)    ->	int:
    UpperCAmelCase__			:		Dict													=				1
    UpperCAmelCase__			:		str													=				2

    for i in range(2  ,					max_n + 1						):
        UpperCAmelCase__			:		Tuple													=				pre_numerator
        UpperCAmelCase__			:		Tuple													=				2 * i // 3 if i % 3 == 0 else 1
        UpperCAmelCase__			:		str													=				cur_numerator
        UpperCAmelCase__			:		List[str]													=				e_cont * pre_numerator + temp

    return sum_digits(lowerCAmelCase__						)


if __name__ == "__main__":
  print(F"""{solution() = }""")
