




def  UpperCAmelCase_							(				__UpperCAmelCase						:     int = 1_00							) ->			int:
      SCREAMING_SNAKE_CASE_     						=      set()

      SCREAMING_SNAKE_CASE_     						=      0

      SCREAMING_SNAKE_CASE_     						=      n + 1  # maximum limit

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


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





def  UpperCAmelCase_							(				__UpperCAmelCase						:     Optional[Any]      ,      __UpperCAmelCase						:     Union[str, Any]							) ->			List[str]:
      SCREAMING_SNAKE_CASE_     						=      0
      while b > 0:
            if b & 1:
                  res += a

            a += a
            b >>= 1

      return res

def  UpperCAmelCase_							(				__UpperCAmelCase						:     str      ,      __UpperCAmelCase						:     int      ,      __UpperCAmelCase						:     Tuple							) ->			int:
      SCREAMING_SNAKE_CASE_     						=      0
      while b > 0:
            if b & 1:
                  SCREAMING_SNAKE_CASE_     						=      ((res % c) + (a % c)) % c

            a += a
            b >>= 1

      return res