public class Euler85 {
    public static void main(String[] args) {
        int target = 2000000;
        long bestArea = 0, bestDiff = Long.MAX_VALUE;
        for (int a = 1; a <= 2000; a++)
            for (int b = a; b <= 2000; b++) {
                long count = (long) a * (a + 1) * b * (b + 1) / 4;
                long diff = Math.abs(count - target);
                if (diff < bestDiff) {
                    bestDiff = diff;
                    bestArea = (long) a * b;
                }
                if (count > target)
                    break;
            }
        System.out.println(bestArea);
    }
}