You are given a positive integer X. Find the largest perfect power that is at most X. Here, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.

Constraints

* 1 ≤ X ≤ 1000
* X is an integer.

Input

Input is given from Standard Input in the following format:


X


Output

Print the largest perfect power that is at most X.

Examples

Input

10


Output

9


Input

1


Output

1


Input

999


Output

961
import java.util.Scanner;

public class Main {

	public static void main(String[] args){
		  Scanner sc = new Scanner(System.in);
		  int X = sc.nextInt();
		  sc.close();
		  
		  if(X == 1) {
			  System.out.println("1");
		      System.exit(0);
		  }
		  
		  int answer = 1;
		  
		  for(int base = 2; base <= Math.sqrt(X); base++) {
			  int i = 2;
			  while(Math.pow(base, i) <= X) {
				  answer = Math.max(answer, (int)Math.pow(base, i));
				  i++;
			  }
		  }
		 
		  System.out.println(answer);
	      System.exit(0);
	    }
}