public class Euler9 {
    static long solve(int targetSum) {
        for (int a = 1; a < targetSum; a++) {
            for (int b = a + 1; b < targetSum; b++) {
                int c = targetSum - a - b;
                if (c <= b)
                    continue;
                if (a * a + b * b == c * c) {
                    return (long) a * b * c;
                }
            }
        }
        return 0;
    }

    public static void main(String[] args) {
        assert solve(12) == 60 : "Checkpoint failed for sum=12";
        System.out.println(solve(1000));
    }
}