



def    _snake_case (       __snake_case = 1_0_0    )     ->     int:






      '''simple docstring'''







      UpperCAmelCase_  :	Tuple				      =		set()

      UpperCAmelCase_  :	Any				      =		0

      UpperCAmelCase_  :	List[Any]				      =		n + 1  # maximum limit

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


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





def    _snake_case (       __snake_case					,  __snake_case    )     ->     int:






      '''simple docstring'''







      return int((input_a, input_a).count(0    ) != 0    )







def    _snake_case (       )     ->     None:






      '''simple docstring'''







      assert nand_gate(0					,  0    ) == 1
      assert nand_gate(0					,  1    ) == 1
      assert nand_gate(1					,  0    ) == 1
      assert nand_gate(1					,  1    ) == 0


if __name__ == "__main__":
   print(nand_gate(0, 0))
   print(nand_gate(0, 1))
   print(nand_gate(1, 0))
   print(nand_gate(1, 1))
