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;

class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int X = scanner.nextInt();
        int max = 1;
        for (int x = X / 2; x > 1; x--) {
            for (int y = X / 2; y > 1; y--) {
                double pow = Math.pow((double) x, (double) (y));
                if (pow > max && pow <= X) {
                    max = ((int) pow);
                }
            }
        }
        System.out.print(max);
    }
}
