Problem:


Score : 100 points

Problem Statement

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.

Sample Input 1

4 5

Sample Output 1

Possible

If Snuke gives nine cookies, each of the three goats can have three cookies.

Sample Input 2

1 1

Sample Output 2

Impossible

Since there are only two cookies, the three goats cannot have the same number of cookies no matter what Snuke gives to them.



Sample input:
4 5


Sample output:
Possible

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A % 3 == 0 or B % 3 == 0 or (A+B) % 3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print("Possible") if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0 else print("Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:

a,b=map(int,input().split())

if a%3==0 or b%3==0 or (a+b)%3==0:print('Possible')
else:print('Impossible')

Submission status: Accepted

Solution code:
a,b= map(int,input().split())

if(a%3== 0 or b%3== 0 or (a+b)%3== 0):
  print("Possible")
else:
  print("Impossible")

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
c=min([(A+B)%3,A%3,B%3])
print(['Possible','Impossible'][c!=0])

Submission status: Accepted

Solution code:
a,b = map(int, input().split())

if a*b % 3 ==0:
    print("Possible")

elif (a+b) %3 ==0:
    print("Possible")

else:
    print("Impossible")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print('Possible' if a%3==0 or b%3==0 or (a+b)%3==0 else 'Impossible')

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


a, b = LI()
ans = 'Impossible'
if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
    ans = 'Possible'
print(ans)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

if A%3==0 or B%3==0 or (A+B)%3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

print('Possible' if A%3==0 or B%3==0 or (A+B)%3==0 else 'Impossible')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a%3!=0 and b%3!=0 and (a+b)%3!=0:
  print('Impossible')
else:
  print('Possible')

Submission status: Accepted

Solution code:
n = input().split()
a = int(n[0])
b = int(n[1])
if a%3 == 0 or b%3 == 0 or (a+b)%3 == 0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
def main():
    a,b = list(map(int, input().split()))
    if a % 3 != 0 and b % 3 != 0:
        if (a+b) % 3 != 0:
            print('Impossible')
            exit()
    print('Possible')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print('Impossible' if a%3 and b%3 and (a+b)%3 else 'Possible')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if (A % 3 == 0) or (B % 3 == 0) or ((A + B) % 3 == 0):
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b = map(int, readline().split())
if a % 3 == 0 or b % 3 == 0 or(a + b) % 3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a+b)*a*b%3:
    print("Impossible")
else:
    print("Possible")

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
if x % 3 == 0 or y % 3 == 0 or (x + y) % 3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
N,M=list(map(int,input().split()))
if any([N%3==0,(N+M)%3==0,M%3==0]):
   print("Possible")
else:
   print("Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
A,B = map (int,input().split())
if A%3 == 0 or B%3==0 or (A+B)%3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
def main():
  num = list(map(int,input().split()))
  if num[0]%3==0 or num[1]%3==0 or (num[0]+num[1])%3==0:
    print('Possible')
  else:
    print('Impossible')
    
main()

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
if A%3 == 0 or B%3 == 0 or (A+B)%3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a % 3 == 0 or b % 3 == 0 or (a+b) % 3 == 0:
  print("Possible")
else:
  print("Impossible")

Submission status: Accepted

Solution code:
A,B = map(int,input().split()) 
if A % 3 == 0 or B % 3 == 0 or (A+B)%3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    A,B=map(int,input().split())
    if A%3==0 or B%3==0 or (A+B)%3==0:
        print('Possible')
    else:
        print('Impossible')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A%3==0 or B%3==0 or (A+B)%3==0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 12:29:30 2020

@author: shinba
"""

a,b = map(int,input().split())

if a % 3 == 0:
    print("Possible")
elif b % 3 == 0:
    print("Possible")
elif (a+b) % 3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B = map(int, input().split())

print(['Impossible', 'Possible'][A%3 == 0 or B%3 == 0 or (A+B) %3 == 0])

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if (A%3==0 or B%3==0 or (A+B)%3==0):
    print ("Possible")
else:
    print ("Impossible")

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if (A+B)%3==0 or A%3==0 or B%3==0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def solve(a, b):
    if a % 3 == 0:
        return True
    if b % 3 == 0:
        return True
    if (a + b) % 3 == 0:
        return True
    return False

def main():
    a, b = map(int, input().split())
    if solve(a, b):
        print('Possible')
    else:
        print('Impossible')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
print("Impossible" if (A+B)%3!=0 and A%3!=0 and B%3!=0 else "Possible")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

A,B = inputIL()

if A%3 and B%3 and (A+B)%3:
  print("Impossible")
else:
  print("Possible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print("Impossible" if (a % 3) and (b % 3) and ((a + b) % 3) else "Possible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a % 3 == 0 or b % 3 == 0 or (a+b) % 3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
A,B=map(int, input().split())
print("Possible" if A%3==0 or B%3==0 or (A+B)%3==0 else "Impossible")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print("Possible" if A % 3 == 0 or B % 3 == 0 or (A + B) %
      3 == 0 else "Impossible")

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    if a % 3 == 0 or b % 3 == 0 or (a+b) % 3 == 0:
        ans = 'Possible'
    else:
        ans = 'Impossible'
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a%3 == 0 or b %3 == 0 or (a + b)%3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
A,B= map(int,input().split())	
if(A%3 ==0)or(B%3==0)or((A+B)%3 ==0):
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ans = 'Impossible'
if (a+b) % 3 == 0:
    ans = 'Possible'
elif a % 3 == 0:
    ans = 'Possible'
elif b % 3 == 0:
    ans = 'Possible'
print(ans)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if A % 3 == 0:
    print("Possible")
elif B % 3 == 0:
    print("Possible")
elif (A + B) % 3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if (a + b) % 3 == 0 or a % 3 == 0 or b % 3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    A, B = map(int, input().split())

    if A % 3 == 0 or B % 3 == 0 or (A + B) % 3 == 0:
        ans = "Possible"
    else:
        ans = "Impossible"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a%3==0 or b%3==0 or (a+b)%3==0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
# endregion

A, B = ri_()
print('Possible' if A % 3 ==0 or B % 3 == 0 or (A + B) % 3 == 0 else 'Impossible')

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
print('Possible' if (A%3==0 or B%3==0 or (A+B)%3==0) else 'Impossible')

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A % 3 == 0:
    print("Possible")
elif B % 3 == 0:
    print("Possible")
elif (A + B)  % 3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print('Possible' if (((a+b)%3==0)or(a%3==0)or(b%3==0)) else 'Impossible')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
dum = a+b
if a % 3 == 0 or b % 3 == 0 or dum % 3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
#Sharing Cookies
def ABC_67_A():
    A,B = map(int, input().split())
    
    if A%3 == 0:
        print('Possible')
    elif B%3 == 0:
        print('Possible')
    elif (A+B)%3 == 0:
        print('Possible')
    else:
        print('Impossible')

#ABCxxx
def ABC_68_A():
    N = input()
    print('ABC'+N)
    
    

if __name__ == '__main__':

    ABC_67_A()

Submission status: Accepted

Solution code:
def ABC_67_A():
    A,B = map(int, input().split())
    
    if A%3 == 0:
        print('Possible')
    elif B%3 == 0:
        print('Possible')
    elif (A+B)%3 == 0:
        print('Possible')
    else:
        print('Impossible')

if __name__ == '__main__':

    ABC_67_A()

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))

if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

if A%3 == 0 or B%3 == 0 or (A+B)%3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
A,B = map(int, input().split())

if A % 3 == 0 or B % 3 == 0 or (A+B) % 3  == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
A, B = list(map(int,input().split()))
if A%3 == 0 or B%3 == 0 or (A+B)%3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
def main():
    a,b = (int(x) for x in input().split())
    c = [True for x in (a,b,a+b) if x%3==0]
    print('Possible' if c else 'Impossible')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B = list(map(int,input().split()))
print('Impossible' if (A*B*(A+B))%3 else 'Possible')

Submission status: Accepted

Solution code:
A,B=map(int,input().split());print('Possible' if A*B*(A+B)%3==0 else 'Impossible')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print ('Possible' if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0 else 'Impossible')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a%3!=0 and b%3!=0 and (a+b)%3!=0:
    print('Impossible')
else:
    print('Possible')

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A % 3 == 0 or B % 3 == 0 or (A + B) % 3 == 0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A, B = MAP()
print("Possible" if A%3 == 0 or B%3 == 0 or (A+B)%3 == 0 else "Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print("Possible" if (a + b) % 3 == 0 or a % 3 == 0 or b % 3 == 0 else "Impossible")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print("Possible" if a%3==0 or b%3==0 or (a+b)%3==0 else "Impossible")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a % 3 == 0 or b%3 == 0 or (a+b)%3==0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

A, B = map(int, input().split())

if A%3 == 0 or B%3 == 0 or (A+B)%3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections


a,b = map(int,input().split())
if (a+b)%3 == 0:
    print("Possible")
elif a%3 == 0:
    print("Possible")
elif b%3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

if A%3 == 0 or B%3 == 0 or (A+B)%3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
    ans="Possible"
else:
    ans="Impossible"
print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
n=[a,b,a+b]
if len([i for i in n if i%3==0])>0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
def resolve():
	a, b = map(int, input().split())
	if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
		print("Possible")
	else:
		print("Impossible")
resolve()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a+b)%3==0 or a%3==0 or b%3==0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a%3 and b%3 and (a+b)%3:
  print("Impossible")
else:
  print("Possible")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

a,b=MI()
i=a%3
j=b%3
k=(a+b)%3
if i!=0 and j!=0 and k!=0:
    print("Impossible")
else:
    print("Possible")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
  print("Possible")
else:
  print("Impossible")

Submission status: Accepted

Solution code:
import sys
a,b=map(int, input().split())
s=[a,b,a+b]
for si in s:
  if si%3==0:
    print('Possible')
    sys.exit()

print('Impossible')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print("Possible" if ((a+b)%3==0 or a%3==0 or b%3==0) else "Impossible")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a*b*(a+b)%3==0:
  print("Possible")
else:
  print("Impossible")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print("Possible" if (a%3==0) or (b%3==0) or((a+b)%3==0) else "Impossible")

Submission status: Accepted

Solution code:

def resolve():
    A, B = list(map(int, input().split()))
    print("Possible" if A%3==0 or B%3==0 or (A+B)%3==0 else "Impossible")


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a%3 == b%3 == 1 or a%3 == b%3 == 2:
  print('Impossible')
else:
  print('Possible')

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A % 3 == 0 or B % 3 == 0 or (A+B) % 3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if A%3 == 0 or B%3 == 0 or (A+B)%3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

if A % 3 == 0 or B % 3 == 0 or (A+B) % 3 == 0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
a,b=[int(i) for i in input().split()]
if a%3==0 or b%3==0 or (a+b)%3==0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A%3==0 or B%3==0 or (A+B)%3==0: print("Possible")
else: print("Impossible")

Submission status: Accepted

Solution code:
x, y = map(int,input().split())

if x%3 == 0 or y%3 == 0 or (x+y)%3 == 0:
  print("Possible")
else:
  print("Impossible")

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if A%3 == 0 or B%3 == 0 or (A+B)%3 == 0:
  print("Possible")
else:
  print("Impossible")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if (a*b) % 3 == 0 or (a+b) % 3 == 0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if a%3==0 or b%3==0 or (a+b)%3==0:
	print("Possible")
else:
	print("Impossible")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a%3==0 or b%3==0 or (a+b)%3==0) and a+b>2:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if a%3==0 or b%3==0 or (a+b)%3==0:
	print("Possible")
else:
	print("Impossible")

Submission status: Accepted

Solution code:
def resolve():
    a,b=map(int, input().split())
    if a%3==0 or b%3==0 or (a+b)%3==0:
        print('Possible')
    else:
        print('Impossible')
resolve()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

    A,B=map(int,input().split())
    print('Possible' if A%3==0 or B%3==0 or (A+B)%3==0 else 'Impossible')

resolve()

Submission status: Accepted

Solution code:

a, b = map(int, input().split())
print("Possible" if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0 else "Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a%3 == 0:
    print("Possible")

elif b%3 == 0:
    print("Possible")

elif (a+b)%3 == 0:
    print("Possible")

else:
    print("Impossible")

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
flag = 0
for i in (A, B, A+B):
    if i % 3 == 0:
        flag = 1
if flag:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())

if a%3==0 or b%3==0 or (a+b)%3==0:
  print("Possible")
else:
  print("Impossible")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

print("Possible" if (A+B)%3==0 or A%3==0 or B%3==0 else "Impossible")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A%3 == 0 or B%3 == 0 or (A+B)%3 ==0:
  print("Possible")
else:
  print("Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a % 3 and b % 3 and (a + b) % 3:
    print("Impossible")
else:
    print("Possible")

Submission status: Accepted

Solution code:
# AtCoder
A, B = map(int, input().split())
if A % 3 == 0 or B % 3 == 0 or (A+B) % 3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
s=a+b

if s%3==0 or a%3==0 or b%3==0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print("Possible" if a%3==0 or b%3 ==0 or (a+b)%3 ==0 else "Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split() )

if a % 3 != 0 and b % 3 != 0 and (a+b) % 3 != 0:
  print('Impossible')
else:
  print('Possible')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print ("Possible") if a%3 == 0 or b%3 == 0 or (a+b)%3 == 0 else print ("Impossible")

Submission status: Accepted

Solution code:
a,b = list(map(int,input().split()))
if a%3 == 0 or (a+b)%3 == 0 or b%3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a%3 == 0 or b%3==0 or (a+b)%3==0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if A % 3 == 0 or B % 3 == 0:
    print("Possible")
else:
    if (A + B)% 3 == 0:
        print("Possible")
    else:
        print("Impossible")

Submission status: Accepted

Solution code:
a, b=map(int, input().split())

if a%3==0 or b%3==0 or (a+b)%3==0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:

a,b=map(int,input().split())
if(a%3==0 or b%3==0 or (a+b)%3==0):
    print("Possible")

else:
    print("Impossible")

Submission status: Accepted

Solution code:
a, b  = map(int,input().split())

if (a % 3 == 0) or( b % 3 == 0) or ((a + b) % 3 ==0):
  print("Possible")
  
else:
  print("Impossible")

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

if A%3 == 0 or B%3 == 0 or (A+B)%3 == 0:
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
icase=0    
if icase==0:
    a,b=map(int,input().split())
    if (a+b)%3==0 or a%3==0 or b%3==0:    
        print("Possible")
    else:    
        print("Impossible")

Submission status: Accepted

Solution code:
icase=0    
if icase==0:
    a,b=map(int,input().split())
    if (a+b)%3==0 or a%3==0 or b%3==0:    
        print("Possible")
    else:    
        print("Impossible")

Submission status: Accepted

Solution code:
def main():
    A, B = map(int, input().split())

    if A % 3 == 0:
        print("Possible")
    elif B % 3 == 0:
        print("Possible")
    elif (A + B) % 3 == 0:
        print("Possible")
    else:
        print("Impossible")
main()

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

flag=0
if A>=3 and A%3==0:
  flag=1
elif B>=3 and B%3==0:
  flag=1
elif (A+B)>=3 and (A+B)%3==0:
  flag=1
  
print('Possible' if flag==1 else 'Impossible')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ans = "Possible" if a*b*(a+b) % 3 == 0 else "Impossible"
print(ans)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
print('Possible' if 0 in [(A+B)%3, A%3, B%3] else 'Impossible')

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
list = [(A+B)%3, A%3, B%3]
print('Possible' if 0 in list else 'Impossible')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a%3 == 0 or b%3 == 0 or (a+b)%3 == 0:
     print("Possible")
else:
     print("Impossible")

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
if n%3==0 or m%3==0 or (n+m)%3==0:print("Possible")
else:print("Impossible")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

if A % 3 == 0 or B % 3 == 0 or (A+B) % 3 == 0:
    print("Possible")
else:
    print("Impossible")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
print(["P","Imp"][all(map(lambda x: min(x%3, 1), [sum(l)]+l))]+"ossible")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if (a % 3 == 0) or (b % 3 == 0) or ((a + b) % 3 == 0):
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if (A%3==0) or (B%3==0) or ((A+B)%3==0):
    print('Possible')
else:
    print('Impossible')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())

if a%3 == 0 or b%3 == 0 or (a+b)%3 == 0:
  print('Possible')
else:
  print('Impossible')

Submission status: Accepted

Solution code:
a,b=map(int, input().split())

if a%3==0 or b%3==0 or (a+b)%3==0:
  print("Possible")
else:
  print("Impossible")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
ans = 'Possible' if any(x % 3 == 0 for x in [A, B, A + B]) else 'Impossible'
print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
nums = [a, b, a+b]
r = 'Impossible'
for num in nums:
	if num % 3 == 0:
		r = 'Possible'
		break
print(r)