문제<\/h2>
Many problems given in programming competitions are extreme in this or that regard. Examples include:<\/p>

a problem that is solved by doing lots of heavy math on paper and then by printing one well-known number, rounded to the number of digits given in the input file;<\/li>
a problem that spans more than four pages and requires you to write a simulation system that tracks multiple skills of several secret agents and chooses the best combination of them for each mission;<\/li>
a problem for which it is a proven fact that no correct solution will ever exist, but it was still given in a contest.<\/li> <\/ul>
This time you are given a problem that is also extreme, in that it has only eight possible tests. And, of course, it will be about something extreme.<\/p>
We consider functions of two integer variables, defined on the $[<\/mo>-<\/mo>10<\/mn>;<\/mo>10<\/mn>]<\/mo>\times<\/mo>[<\/mo>-<\/mo>10<\/mn>;<\/mo>10<\/mn>]<\/mo><\/mrow>[-10;10] \times [-10;10]<\/math><\/span><\/span> [<\/span> -<\/span> 10<\/span>;<\/span> <\/span> 10<\/span>]<\/span> <\/span> \times<\/span> <\/span><\/span> <\/span> [<\/span> -<\/span> 10<\/span>;<\/span> <\/span> 10<\/span>]<\/span><\/span><\/span><\/span> square. It means that you can perform a call to f<\/mi>(<\/mo>x<\/mi>,<\/mo>y<\/mi>)<\/mo><\/mrow>f(x,y)<\/math><\/span><\/span> f<\/span>$

Extreme Problem