id
stringclasses 1
value | instruction
stringlengths 29
13k
| trajectory
listlengths 2
406
| length
int64 2
406
| public_tests
listlengths 1
7
| generated_tests
listlengths 0
100
|
|---|---|---|---|---|---|
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nprint(\"Possible\" if ((a+b)%3==0 or a%3==0 or b%3==0) else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\n\nif A%3 > 0 and B%3 > 0 and (A+B)%3 > 0:\n print('Impossible')\n",
"A,B=map(int,input().split())\n\nif A%3 > 0 and B%3 > 0 and (A+B)%3 > 0:\n print('Impossible')\nelse:\n print('Possible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nif not (a%3 and b%3 and (a+b)%3):\n print('Possible')\n",
"a,b=map(int,input().split())\nif not (a%3 and b%3 and (a+b)%3):\n print('Possible')\nelse:\n print('Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nif a%3 and b%3 and (a+b)%3:\n print('Impossible')\n",
"a,b = map(int,input().split())\nif a%3 and b%3 and (a+b)%3:\n print('Impossible')\nelse:\n print('Possible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\n\nif((A+B)%3==0 or A%3==0 or B%3==0):\n print(\"Possible\")\n",
"A,B=map(int,input().split())\n\nif((A+B)%3==0 or A%3==0 or B%3==0):\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nc=min([(A+B)%3,A%3,B%3])\n",
"A,B=map(int,input().split())\nc=min([(A+B)%3,A%3,B%3])\nprint(['Possible','Impossible'][c!=0])\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"x,y = map(int,input().split())\n",
"x,y = map(int,input().split())\nif (x+y)%3==0 or x%3==0 or y%3==0:\n print(\"Possible\")\n",
"x,y = map(int,input().split())\nif (x+y)%3==0 or x%3==0 or y%3==0:\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\nprint('Possible' if A%3==0 or B%3==0 or (A+B)%3==0 else 'Impossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nprint(['P','Imp'][all([a%3>0,b%3>0,(a+b)%3>0])]+'ossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a, b = map(int, input().split())\n",
"a, b = map(int, input().split())\nans = \"Possible\" if a*b*(a+b) % 3 == 0 else \"Impossible\"\n",
"a, b = map(int, input().split())\nans = \"Possible\" if a*b*(a+b) % 3 == 0 else \"Impossible\"\nprint(ans)\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split());\n",
"a,b=map(int,input().split());print([\"Impossible\",\"Possible\"][a%3==0 or b%3==0 or (a+b)%3==0])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B = map(int,input().split());\n",
"A,B = map(int,input().split());print([\"Impossible\",\"Possible\",][bool(A%3 is 0 or B%3 is 0 or (A+B)%3 is 0)])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nif (a*b) % 3 == 0 or (a+b) % 3 == 0:\n print('Possible')\n",
"a,b = map(int,input().split())\nif (a*b) % 3 == 0 or (a+b) % 3 == 0:\n print('Possible')\nelse:\n print('Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nprint([\"Possible\",\"Impossible\"][bool(A*B*(A+B)%3)])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nif (a+b)%3 and a%3 and b%3:\n print('Impossible')\n",
"a,b=map(int,input().split())\nif (a+b)%3 and a%3 and b%3:\n print('Impossible')\nelse:\n print('Possible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split());\n",
"A,B=map(int,input().split());print(['Impossible','Possible'][(A%3==0)or(B%3==0)or((A+B)%3==0)])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nprint(\"Impossible\") if all((a%3,b%3,(a+b)%3)) else print(\"Possible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nprint('Impossible' if all([a%3,b%3,(a+b)%3]) else 'Possible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nif min([i%3 for i in [a,b,a+b]])==0 :\n print(\"Possible\")\n",
"a,b = map(int,input().split())\nif min([i%3 for i in [a,b,a+b]])==0 :\n print(\"Possible\")\nelse :\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nprint(\"Impossible\" if (A+B)%3!=0 and A%3!=0 and B%3!=0 else \"Possible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a, b = map(int, (input().split()))\n",
"a, b = map(int, (input().split()))\nprint('Possible'if a%3==0 or b%3==0 or (a+b)%3==0 else 'Impossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nif a*b%3==0 or (a+b)%3==0:print(\"Possible\")\n",
"a,b=map(int,input().split())\nif a*b%3==0 or (a+b)%3==0:print(\"Possible\")\nelse:print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nif (a%3!=0)&(b%3!=0)&((a+b)%3!=0):\n print('Impossible')\n",
"a,b=map(int,input().split())\nif (a%3!=0)&(b%3!=0)&((a+b)%3!=0):\n print('Impossible')\nelse:\n print('Possible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\nprint(\"Possible\" if any((i%3==0 for i in (A, B, A+B))) else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\nprint('Impossible' if A % 3 and B % 3 and (A + B) % 3 else 'Possible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"x,y=list(map(int, input().split()))\n",
"x,y=list(map(int, input().split()))\nif x%3==0 or y%3==0 or (x+y)%3==0:\n print('Possible')\n",
"x,y=list(map(int, input().split()))\nif x%3==0 or y%3==0 or (x+y)%3==0:\n print('Possible')\nelse:\n print('Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=list(map(int,input().split()))\n",
"A,B=list(map(int,input().split()))\nprint(\"Possible\" if (A*B)%3==0 or (A+B)%3==0 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split());\n",
"A,B=map(int,input().split());print(['P','Imp'][A%3*(B%3)*(A+B)%3>0]+'ossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nprint([\"Impossible\", \"Possible\"][a*b*(a+b)%3==0])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\nprint(\"Possible\" if any(v % 3 is 0 for v in (A, B, A + B)) else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\n\nif A * B * (A+B) % 3 == 0:\n print(\"Possible\")\n",
"A, B = map(int, input().split())\n\nif A * B * (A+B) % 3 == 0:\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nprint((\"Impossible\",\"Possible\")[a*b*(a+b)%3==0])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split());\n",
"a,b=map(int,input().split());print((\"P\",\"Imp\")[a*b%3==1]+\"ossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nprint('Possible' if (a*b)%3==0 or (a+b)%3==0 else 'Impossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B = map(int,input().split())\n",
"A,B = map(int,input().split())\nif A%3==0 or B%3==0 or (A+B)%3==0:print(\"Possible\")\n",
"A,B = map(int,input().split())\nif A%3==0 or B%3==0 or (A+B)%3==0:print(\"Possible\")\nelse : print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\nif A*B%3==0 or (A+B)%3==0:\n print(\"Possible\")\n",
"A, B = map(int, input().split())\nif A*B%3==0 or (A+B)%3==0:\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nprint(\"Possible\" if not a%3 or not b%3 or not (a+b)%3 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int,input().split())\n",
"A, B = map(int,input().split())\nlist = [(A+B)%3, A%3, B%3]\n",
"A, B = map(int,input().split())\nlist = [(A+B)%3, A%3, B%3]\nprint('Possible' if 0 in list else 'Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split());\n",
"A,B=map(int,input().split());print(\"PIomspsoisbslieb l e\"[all([A%3,B%3,(A+B)%3])::2])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\nprint([\"Possible\", \"Impossible\"][not(A % 3 == 0 or B % 3 == 0 or (A + B) % 3 == 0)])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nprint(\"Impossible\" if (a%3*b%3==1 or a%3*b%3==4) else \"Possible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nif a%3*b%3*(a+b)%3==0:print(\"Possible\")\n",
"a,b=map(int,input().split())\nif a%3*b%3*(a+b)%3==0:print(\"Possible\")\nelse:print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int,input().split())\n",
"A, B = map(int,input().split())\nif A%3*B%3*(A+B)%3 == 0:\n print(\"Possible\")\n",
"A, B = map(int,input().split())\nif A%3*B%3*(A+B)%3 == 0:\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nprint(\"Possible\" if (a+b)%3==0 or a%3==0 or b%3==0 else(\"Impossible\"))\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split(\" \"))\n",
"A,B=map(int,input().split(\" \"))\nprint(\"Impossible\" if A*B*(A+B)%3 else \"Possible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = list(map(int, input().split()))\n",
"A, B = list(map(int, input().split()))\n\nif A*B*(A+B) %3 == 0:\n print('Possible')\n",
"A, B = list(map(int, input().split()))\n\nif A*B*(A+B) %3 == 0:\n print('Possible')\nelse:\n print('Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split());\n",
"A,B=map(int,input().split());print('Possible' if A*B*(A+B)%3==0 else 'Impossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b =map(int,input().split())\nk = a%3\ns = b%3\n",
"a,b =map(int,input().split())\nk = a%3\ns = b%3\nif k == s and k != 0:\n print(\"Impossible\")\n",
"a,b =map(int,input().split())\nk = a%3\ns = b%3\nif k == s and k != 0:\n print(\"Impossible\")\nelse:\n print(\"Possible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b= list(map(int, input().split()))\n",
"a,b= list(map(int, input().split()))\nprint(\"Possible\" if a%3 == 0 or b%3 == 0 or (a+b)%3 == 0 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split());\n",
"a,b=map(int,input().split());print(['Impossible','Possible'][a%3==0 or b%3==0 or (a+b)%3==0])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int, input().split())\n",
"a,b = map(int, input().split())\nprint(\"Possible\") if (a%3==0)|(b%3==0)|((a+b)%3==0) else print(\"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\n\nif (A * B * (A + B)) % 3 == 0:\n print('Possible')\n",
"A, B = map(int, input().split())\n\nif (A * B * (A + B)) % 3 == 0:\n print('Possible')\nelse:\n print('Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"x, y = map(int, input().strip().split())\n",
"x, y = map(int, input().strip().split())\ne = x%3==0 or y%3==0 or (x+y)%3==0\n",
"x, y = map(int, input().strip().split())\ne = x%3==0 or y%3==0 or (x+y)%3==0\nprint(\"Possible\" if e else \"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\n\nprint('Possible' if a%3==0 or b%3==0 or (a+b)%3==0 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nprint(\"Possible\" if (a%3==0) or (b%3==0) or((a+b)%3==0) else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a, b = (int(i) for i in input().split())\n",
"a, b = (int(i) for i in input().split())\nprint(\"Possible\" if (a+b)%3==0 or a%3==0 or b%3==0 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int, input().split())\n",
"a,b=map(int, input().split())\nif a%3==0 or (a+b)%3==0 or b%3==0 : print('Possible')\n",
"a,b=map(int, input().split())\nif a%3==0 or (a+b)%3==0 or b%3==0 : print('Possible')\nelse: print('Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nx = a%3==0 or b%3==0 or (a+b)%3==0\n",
"a,b=map(int,input().split())\nx = a%3==0 or b%3==0 or (a+b)%3==0\nprint('Possible'if x else'Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\nprint(\"Possible\" if (A%3==0) or (B%3==0) or ((A+B)%3==0) else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\nC = A + B\n",
"A, B = map(int, input().split())\nC = A + B\n\nprint(\"Possible\" if A%3==0 or B%3==0 or C%3==0 else \"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a, b = map(int, input().split())\n",
"a, b = map(int, input().split())\nprint(\"Impossible\" if (a%3)*(b%3)*((a+b)%3) else \"Possible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"num=list(map(int,input().split()))\n",
"num=list(map(int,input().split()))\nprint(\"Possible\" if sum(num)%3==0 or num[0]%3==0 or num[1]%3==0 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a, b = map(int, input().split())\n",
"a, b = map(int, input().split())\n\nprint(\"Possible\" if (a+b)%3 == 0 or (a)%3 == 0 or (b)%3==0 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nprint(['Impossible','Possible'][(A%3==0)or(B%3==0)or((A+B)%3==0)])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a, b = map(int, input().split())\n",
"a, b = map(int, input().split())\nprint((\"Impossible\", \"Possible\")[a % 3 * b % 3 * (a + b) % 3 == 0])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\nx='Impossible'\n\nprint(x)\n",
"a,b=map(int,input().split())\nx='Impossible'\nif a%3==0 or b%3==0 or (a+b)%3==0:\n x='Possible'\nprint(x)\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nprint(\"Possible\" if A%3 * B%3 * (A+B)%3==0 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split());\n",
"a,b=map(int,input().split());print('IPmopsossisbilbel e'[a%3==0 or b%3==0 or (a+b)%3==0::2])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"b, c = map(int, input().split())\n",
"b, c = map(int, input().split())\nif(b%3==0 or c%3==0 or (b+c)%3==0):\n print(\"Possible\")\n",
"b, c = map(int, input().split())\nif(b%3==0 or c%3==0 or (b+c)%3==0):\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nprint(\"Possible\" if a*b*(a+b)%3==0 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split());\n",
"a,b=map(int,input().split());print(['P','Imp'][a*b*(a+b)%3>0]+'ossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a, b = map(int, input().split())\n",
"a, b = map(int, input().split())\nprint('Possible' if a % 3 == 0 or b % 3 == 0 or (a + b ) % 3 == 0 else 'Impossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"print([\"P\",\"Imp\"][eval(input().replace(' ','*'))%3%2]+\"ossible\")\n"
] | 2
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nprint([\"Impossible\",\"Possible\"][A%3==0 or B%3==0 or (A+B)%3==0])\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"x,y=map(int,input().split())\n",
"x,y=map(int,input().split())\nif x%3==0 or y%3==0 or (x+y)%3==0:\n print('Possible')\n",
"x,y=map(int,input().split())\nif x%3==0 or y%3==0 or (x+y)%3==0:\n print('Possible')\nelse:\n print('Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\nc=a+b\n",
"a,b=map(int,input().split())\nc=a+b\nprint('Possible' if a%3==0 or b%3==0 or c%3==0 else 'Impossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nprint(\"Possible\" if any([a%3==0,b%3==0,(a+b)%3==0]) else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nans=\"Impossible\"\n",
"A,B=map(int,input().split())\nans=\"Impossible\"\nif A%3==0 or B%3==0 or (A+B)%3==0:\n ans=\"Possible\"\n",
"A,B=map(int,input().split())\nans=\"Impossible\"\nif A%3==0 or B%3==0 or (A+B)%3==0:\n ans=\"Possible\"\nprint(ans)\n"
] | 5
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a, b = map(int, input().split())\n",
"a, b = map(int, input().split())\nprint(\"Impossible\" if (a % 3) and (b % 3) and ((a + b) % 3) else \"Possible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nif (A%3==0)|(B%3==0)|((A+B)%3==0):\n print(\"Possible\")\n",
"A,B=map(int,input().split())\nif (A%3==0)|(B%3==0)|((A+B)%3==0):\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int, input().split())\n",
"a,b=map(int, input().split())\nif a%3==0 or b%3==0 or (a+b)%3==0:\n print(\"Possible\")\n",
"a,b=map(int, input().split())\nif a%3==0 or b%3==0 or (a+b)%3==0:\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B = map(int, input().split())\n",
"A, B = map(int, input().split())\nprint(\"Possible\" if A * B * (A + B) % 3 == 0 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A, B =map(int,input().split())\n",
"A, B =map(int,input().split())\nC = A*B*(A+B)\n",
"A, B =map(int,input().split())\nC = A*B*(A+B)\nif C%3==0:\n print('Possible')\n",
"A, B =map(int,input().split())\nC = A*B*(A+B)\nif C%3==0:\n print('Possible')\nelse:\n print('Impossible')\n"
] | 5
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b =map(int,input().split())\na%=3\nb%=3\n",
"a,b =map(int,input().split())\na%=3\nb%=3\nprint(\"Possible\" if not a or not b or not (a+b)%3 else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"x,y=map(int,input().split());\n",
"x,y=map(int,input().split());print(['P','Imp'][all([x%3>0,y%3>0,(x+y)%3>0])]+'ossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nif a*b*(a+b)%3==0:\n print(\"Possible\")\n",
"a,b=map(int,input().split())\nif a*b*(a+b)%3==0:\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nf=a%3==0 or b%3==0 or (a+b)%3==0\n",
"a,b=map(int,input().split())\nf=a%3==0 or b%3==0 or (a+b)%3==0\nprint(\"Possible\" if f==True else \"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nnum=(A*B*(A+B))%3\n",
"A,B=map(int,input().split())\nnum=(A*B*(A+B))%3\nif num==0:\n print('Possible')\n",
"A,B=map(int,input().split())\nnum=(A*B*(A+B))%3\nif num==0:\n print('Possible')\nelse:\n print('Impossible')\n"
] | 5
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\nc=a+b\n",
"a,b=map(int,input().split())\nc=a+b\nprint('Impossible' if a%3 and b%3 and c%3 else 'Possible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split());\n",
"a,b=map(int,input().split());print(\"Possible\" if (a%3==0 or b%3==0 or (a+b)%3==0) else \"Impossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split());\n",
"a,b=map(int,input().split());print(('P','Imp')[all(i%3 for i in (a,b,a+b))]+'ossible')\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=(map(int,input().split()))\n",
"a,b=(map(int,input().split()))\nif a%3==0 or b%3==0 or (a+b)%3==0:\n print(\"Possible\")\n",
"a,b=(map(int,input().split()))\nif a%3==0 or b%3==0 or (a+b)%3==0:\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"X,Y=map(int,input().split())\n",
"X,Y=map(int,input().split())\nif X%3==0 or Y%3==0 or (X+Y)%3==0:\n print(\"Possible\")\n",
"X,Y=map(int,input().split())\nif X%3==0 or Y%3==0 or (X+Y)%3==0:\n print(\"Possible\")\nelse:\n print(\"Impossible\")\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split())\n",
"a,b=map(int,input().split())\nprint([\"P\",\"Imp\"][a%3==b%3 and (a%3==1 or a%3==2)]+\"ossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nif A%3*B%3*(A+B)%3==0:print('Possible')\n",
"A,B=map(int,input().split())\nif A%3*B%3*(A+B)%3==0:print('Possible')\nelse:print('Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split());\n",
"a,b=map(int,input().split());print((\"P\",\"Imp\")[a*b%3%2]+\"ossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"x,y=map(int, input().split())\n",
"x,y=map(int, input().split())\nif x%3!=0 and y%3!=0 and (x+y)%3!=0:\n print('Impossible')\n",
"x,y=map(int, input().split())\nif x%3!=0 and y%3!=0 and (x+y)%3!=0:\n print('Impossible')\nelse:\n print('Possible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b=map(int,input().split());\n",
"a,b=map(int,input().split());print([\"Imp\",\"P\"][a*b*(a+b)%3==0]+\"ossible\")\n"
] | 3
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"A,B=map(int,input().split())\n",
"A,B=map(int,input().split())\nif A%3==0 or (A+B)%3==0 or B%3==0:\n print('Possible')\n",
"A,B=map(int,input().split())\nif A%3==0 or (A+B)%3==0 or B%3==0:\n print('Possible')\nelse:\n print('Impossible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
0/::0
|
Snuke is giving cookies to his three goats.
He has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).
Your task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.
Constraints
* 1 \leq A,B \leq 100
* Both A and B are integers.
Input
Input is given from Standard Input in the following format:
A B
Output
If it is possible to give cookies so that each of the three goats can have the same number of cookies, print `Possible`; otherwise, print `Impossible`.
Examples
Input
4 5
Output
Possible
Input
1 1
Output
Impossible
|
[
"\n",
"a,b = map(int,input().split())\n",
"a,b = map(int,input().split())\nif a%3 == b%3 == 1 or a%3 == b%3 == 2:\n print('Impossible')\n",
"a,b = map(int,input().split())\nif a%3 == b%3 == 1 or a%3 == b%3 == 2:\n print('Impossible')\nelse:\n print('Possible')\n"
] | 4
|
[
{
"input": "4 5",
"output": "Possible"
},
{
"input": "1 1",
"output": "Impossible"
}
] |
[
{
"input": "4 0",
"output": "Possible\n"
},
{
"input": "-1 2",
"output": "Impossible\n"
},
{
"input": "1 2",
"output": "Possible\n"
},
{
"input": "7 0",
"output": "Possible\n"
},
{
"input": "0 2",
"output": "Possible\n"
},
{
"input": "7 -1",
"output": "Possible\n"
},
{
"input": "7 -2",
"output": "Impossible\n"
},
{
"input": "-1 4",
"output": "Possible\n"
},
{
"input": "7 -4",
"output": "Possible\n"
},
{
"input": "-1 8",
"output": "Impossible\n"
},
{
"input": "5 -4",
"output": "Impossible\n"
},
{
"input": "-1 14",
"output": "Impossible\n"
},
{
"input": "8 -4",
"output": "Impossible\n"
},
{
"input": "-1 28",
"output": "Possible\n"
},
{
"input": "5 0",
"output": "Possible\n"
},
{
"input": "-2 28",
"output": "Impossible\n"
},
{
"input": "5 -1",
"output": "Impossible\n"
},
{
"input": "-2 40",
"output": "Impossible\n"
},
{
"input": "0 -1",
"output": "Possible\n"
},
{
"input": "-3 40",
"output": "Possible\n"
},
{
"input": "-1 -1",
"output": "Impossible\n"
},
{
"input": "-3 57",
"output": "Possible\n"
},
{
"input": "-1 -2",
"output": "Possible\n"
},
{
"input": "-2 57",
"output": "Possible\n"
},
{
"input": "-2 -2",
"output": "Impossible\n"
},
{
"input": "-2 81",
"output": "Possible\n"
},
{
"input": "0 -2",
"output": "Possible\n"
},
{
"input": "-2 29",
"output": "Possible\n"
},
{
"input": "-2 0",
"output": "Possible\n"
},
{
"input": "-3 29",
"output": "Possible\n"
},
{
"input": "-2 1",
"output": "Impossible\n"
},
{
"input": "-3 4",
"output": "Possible\n"
},
{
"input": "-1 1",
"output": "Possible\n"
},
{
"input": "-5 4",
"output": "Impossible\n"
},
{
"input": "0 8",
"output": "Possible\n"
},
{
"input": "-8 4",
"output": "Impossible\n"
},
{
"input": "0 6",
"output": "Possible\n"
},
{
"input": "-13 4",
"output": "Possible\n"
},
{
"input": "-1 6",
"output": "Possible\n"
},
{
"input": "-13 0",
"output": "Possible\n"
},
{
"input": "-1 7",
"output": "Possible\n"
},
{
"input": "-1 0",
"output": "Possible\n"
},
{
"input": "-2 2",
"output": "Possible\n"
},
{
"input": "0 0",
"output": "Possible\n"
},
{
"input": "1 0",
"output": "Possible\n"
},
{
"input": "2 0",
"output": "Possible\n"
},
{
"input": "1 3",
"output": "Possible\n"
},
{
"input": "2 -1",
"output": "Impossible\n"
},
{
"input": "2 2",
"output": "Impossible\n"
},
{
"input": "2 -2",
"output": "Possible\n"
},
{
"input": "2 3",
"output": "Possible\n"
},
{
"input": "3 -2",
"output": "Possible\n"
},
{
"input": "2 6",
"output": "Possible\n"
},
{
"input": "4 -2",
"output": "Impossible\n"
},
{
"input": "2 9",
"output": "Possible\n"
},
{
"input": "1 -2",
"output": "Impossible\n"
},
{
"input": "4 9",
"output": "Possible\n"
},
{
"input": "1 -4",
"output": "Possible\n"
},
{
"input": "2 14",
"output": "Impossible\n"
},
{
"input": "1 -3",
"output": "Possible\n"
},
{
"input": "2 17",
"output": "Impossible\n"
},
{
"input": "1 -1",
"output": "Possible\n"
},
{
"input": "2 1",
"output": "Possible\n"
},
{
"input": "4 1",
"output": "Impossible\n"
},
{
"input": "4 2",
"output": "Possible\n"
},
{
"input": "3 1",
"output": "Possible\n"
},
{
"input": "7 2",
"output": "Possible\n"
},
{
"input": "4 -1",
"output": "Possible\n"
},
{
"input": "7 1",
"output": "Impossible\n"
},
{
"input": "6 -1",
"output": "Possible\n"
},
{
"input": "6 1",
"output": "Possible\n"
},
{
"input": "6 -2",
"output": "Possible\n"
},
{
"input": "6 0",
"output": "Possible\n"
},
{
"input": "9 -2",
"output": "Possible\n"
},
{
"input": "-2 -1",
"output": "Possible\n"
},
{
"input": "9 -1",
"output": "Possible\n"
},
{
"input": "-3 -2",
"output": "Possible\n"
},
{
"input": "11 -1",
"output": "Impossible\n"
},
{
"input": "-1 -4",
"output": "Impossible\n"
},
{
"input": "12 -1",
"output": "Possible\n"
},
{
"input": "-1 -6",
"output": "Possible\n"
},
{
"input": "23 -1",
"output": "Impossible\n"
},
{
"input": "-2 -6",
"output": "Possible\n"
},
{
"input": "23 0",
"output": "Possible\n"
},
{
"input": "-4 -6",
"output": "Possible\n"
},
{
"input": "23 -2",
"output": "Possible\n"
},
{
"input": "-4 -10",
"output": "Impossible\n"
},
{
"input": "15 -2",
"output": "Possible\n"
},
{
"input": "-4 -18",
"output": "Possible\n"
},
{
"input": "15 -3",
"output": "Possible\n"
},
{
"input": "-5 -18",
"output": "Possible\n"
},
{
"input": "0 -3",
"output": "Possible\n"
},
{
"input": "-5 -6",
"output": "Possible\n"
},
{
"input": "1 -6",
"output": "Possible\n"
},
{
"input": "0 -6",
"output": "Possible\n"
},
{
"input": "0 -4",
"output": "Possible\n"
},
{
"input": "0 -11",
"output": "Possible\n"
},
{
"input": "2 -4",
"output": "Impossible\n"
},
{
"input": "0 -17",
"output": "Possible\n"
},
{
"input": "-1 -5",
"output": "Possible\n"
}
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.