For this Question: Tono has two integer intervals [A, B] and [C, D] (the intervals are inclusive of both numbers). She wonders if Solo will be able to solve the following simple problem:
Choose an integer X from first interval and an integer Y from second interval. Now for all combinations of X and Y, what is the maximum value of X*Y.

As Solo is small, please help her solve the problem.The first and the only line of input contains 4 integers A, B, C, and D.

Constraints
-10<sup>9</sup> <= A <= B <= 10<sup>9</sup>
-10<sup>9</sup> <= C <= D <= 10<sup>9</sup>Output a single integer, the maximum value of the product.Sample Input
1 2 1 1

Sample Output
2

Explanation: Choose 2 from [1, 2] and 1 from [1, 1].

Sample Input
3 5 -4 -2

Sample Output
-6

Sample Input
-1000000000 0 -1000000000 0

Sample Output
1000000000000000000, I have written this Solution Code: A,B,C,D=list(map(int,input().split()))
p=[A*C,A*D,B*C,B*D]
print(max(p)), In this Programming Language: Python, Now tell me if this Code is compilable or not?