import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n =sc.nextInt();
		int ans=1;
		int tmpEven=1;
		int tmpOdd=1;
		int count=0;
		boolean even=false, odd=false;
		for (int i = n; i > 0; i--) {
			if(count==3){
				break;
			}
			if(BigInteger.valueOf(i).isProbablePrime(1)){
				ans=ans*i;
				count++;
			} else if(i%2 ==0 && !even){
				ans=ans*i;
				tmpEven=i-2;
				even =true;
				count++;
			} else if(i%2 !=0 && !odd) {
				ans=ans*i;
				tmpOdd=i-2;
				count++;
				odd=true;
			}
		}
		if(count != 3){
			if(n%2 == 0){
				ans=ans*tmpEven;
			}else{
				ans=ans*tmpOdd;
			}
		}
		System.out.println(ans);
	}
}