Problem:


Score: 100 points

Problem Statement

Takahashi is solving quizzes. He has easily solved all but the last one.

The last quiz has three choices: 1, 2, and 3.

With his supernatural power, Takahashi has found out that the choices A and B are both wrong.

Print the correct choice for this problem.

Constraints

Each of the numbers A and B is 1, 2, or 3.

A and B are different.

Input

Input is given from Standard Input in the following format:

A
B

Output

Print the correct choice.

Sample Input 1

3
1

Sample Output 1

2

When we know 3 and 1 are both wrong, the correct choice is 2.

Sample Input 2

1
2

Sample Output 2

3



Sample input:
3
1


Sample output:
2

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if (a == 1 and b == 2) or (a == 2 and b == 1):
  print(3)
elif (a == 1 and b == 3) or (a == 3 and b == 1):
  print(2)
else:
  print(1)

Submission status: Accepted

Solution code:
def ABC_148_A():
    A = int(input())
    B = int(input())
    print(6-A-B)

if __name__ == '__main__':

    ABC_148_A()

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if ( A == 1 or A == 2 ) and ( B == 1 or B == 2) :
    print('3')
elif ( A == 1 or A == 3 ) and ( B == 1 or B == 3) :
    print('2')
elif ( A == 2 or A == 3 ) and ( B == 2 or B == 3) :
    print('1')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  9 16:04:18 2020

@author: shinba
"""

a = int(input())
b = int(input())

print(6-a-b)

Submission status: Accepted

Solution code:
lst=[1, 2, 3]
lst.remove(int(input()))
lst.remove(int(input()))
print(lst[0])

Submission status: Accepted

Solution code:
a, b = [int(input()) for i in range(2)]
ans = 6 - a - b
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
for i in range(1,4):
    if (i != a) and (i != b):
        print(i)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

print(6 - (A + B))

Submission status: Accepted

Solution code:
a, b = map(int, open(0))
print(a^b)

Submission status: Accepted

Solution code:
ans = "123"
print(ans.replace(input(),"").replace(input(),""))

Submission status: Accepted

Solution code:
List = [1, 2, 3]
A = int(input())
B = int(input())
List.remove(A)
List.remove(B)
print(List[0])

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
ans = []
lst = [1,2,3]
ans.append(A)
ans.append(B)

for i in ans:
    if i in lst:
        lst.remove(i)
print(lst[0])

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a!=1 and b!=1:
    print(1)
elif a!=2 and b!=2:
    print(2)
elif a!=3 and b!=3:
    print(3)

Submission status: Accepted

Solution code:
a=[1,2,3]
a.remove(int(input()))
a.remove(int(input()))
print(a[0])

Submission status: Accepted

Solution code:
choices = {'1', '2', '3'}

choices.remove(input())
choices.remove(input())

print(choices.pop())

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
r = 6-A-B
print(r)

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

a = I()
b = I()
c = {a, b}
if c == {1, 2}:
    print("3")
elif c == {2, 3}:
    print("1")
else:
    print("2")

Submission status: Accepted

Solution code:
print(6//(int(input())*int(input())))

Submission status: Accepted

Solution code:
li = []
li.append(int(input()))
li.append(int(input()))
for i in range(1, 4):
    if i not in li:
        print(i)

Submission status: Accepted

Solution code:
a_list = [0]*3
for i in range(2):
    a_list[int(input())-1] = 9
print(a_list.index(0)+1)

Submission status: Accepted

Solution code:
# A - Round One

C = [1, 2, 3]
A = int(input())
B = int(input())

C.remove(A)
C.remove(B)
print(*C)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a != 1 and b != 1:print(1)
elif a != 2 and b != 2: print(2)
else: print(3)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

for i in range(1, 4):
    if i != a and i != b:
        print(i)

Submission status: Accepted

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

a = int(input())
b = int(input())

if a+b == 3:
    print(3)
elif a+b == 4:
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
ans = [1, 2, 3]
ans.remove(A)
ans.remove(B)
print(sum(ans))

Submission status: Accepted

Solution code:
a = input()
b = input()
s = set(['1', '2', '3']) - set([a,b])
print(s.pop())

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
print(6 - (A + B))

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
List=[A,B]

print(6-sum(List))

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
for i in range (1, 4):
  if i != A and i != B:
    print(i)
    break

Submission status: Accepted

Solution code:
a=input()
b=input()
s=[a,b]
if '1' in s and '2' in s:
    print("3")
if '2' in s and '3' in s:
    print("1")
if '1' in s and '3' in s:
    print("2")

Submission status: Accepted

Solution code:
def main():
    mondai = [i for i in range(1, 4)]
    n = 0
    for i in range(2):
        n = int(input())
        mondai.pop(mondai.index(n))
    print(mondai[0])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
v = [1,2,3]
v.remove(a)
v.remove(b)
print(v[0])

Submission status: Accepted

Solution code:
l = [1,2,3]
for _ in range(2):
    n = int(input())
    l.remove(n)
print (l[0])

Submission status: Accepted

Solution code:
array = ['1','2','3']
array.remove(input())
array.remove(input())
print(array[0])

Submission status: Accepted

Solution code:
s = {1, 2, 3}
A = int(input())
B = int(input())

s.remove(A)
s.remove(B)

print(s.pop())

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a == 1 and b == 2:
  print("3")
elif a == 1 and b == 3:
  print("2")
elif a == 2 and b == 3:
  print("1")
elif a == 2 and b == 1:
  print("3")
elif a == 3 and b == 1:
  print("2")
elif a == 3 and b == 2:
  print("1")

Submission status: Accepted

Solution code:
c=[int(input()) for i in range(2)]
print(1 if 1 not in c else 2 if 2 not in c else 3)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
c = 6 - A - B
print(c)

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())

if A==1 and B==2: 
    print(3)
elif A==2 and B==1:
    print(3)
elif A==2 and B==3:
    print(1)
elif A==3 and B==2:
    print(1)
else:
    print(2)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

ansli = [1, 2, 3]
ansli.remove(A)
ansli.remove(B)

print(ansli[0])

Submission status: Accepted

Solution code:
l = [int(input()) for _ in range(2)]
[print(i) for i in range(1, 4) if i not in l]

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

for i in range(1,4):
    if i != a and i != b:
        print(i)

Submission status: Accepted

Solution code:
def solve():
    a = int(input())
    b = int(input())
    return 6-a-b

print(solve())

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  2 20:55:33 2020

@author: Kanaru Sato
"""

a = int(input())
b = int(input())
l = [a,b]

for i in range(1,4):
    if i not in l:
        print(i)
        break

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
ans={1,2,3}-{A,B}
print(ans.pop())

Submission status: Accepted

Solution code:
def main():
  A=int(input())
  B=int(input())
  if(A+B==3):
    print(str(3))
  elif(A+B==4):
    print(str(2))
  else:
    print(str(1))

if __name__=='__main__':
  main()

Submission status: Accepted

Solution code:
l = [int(input()),int(input())]

for i in range(3):
    if((i+1) not in l):
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
ans = list("123")

for i in range(2):
  ans.remove(str(input()))

print(int(ans[0]))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
 
p = list(map(int,range(1,4)))
p.remove(a)
p.remove(b)
print(p[0])

Submission status: Accepted

Solution code:
x = int(input())
y = int(input())

if x != 1 and y != 1:
    print(1)
if x != 2 and y != 2:
    print(2)
if x != 3 and y != 3:
    print(3)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

test =[1,2,3]
test.remove(A)
test.remove(B)

print(test[0])

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())


ans = [1,2,3]

for i in ans:
    if i != A and i != B:
        print(i)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print(6 - a - b)

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
n=[1,2,3]
n.remove(a)
n.remove(b)
print(n[0])

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
for n in [1,2,3]:
    if n!=a and n!=b:
        print(n)

Submission status: Accepted

Solution code:

a=int(input())
b=int(input())
print(6-(a+b))

Submission status: Accepted

Solution code:
x = [1, 2, 3]
A = int(input())
B = int(input())
x.remove(A)
x.remove(B)
print(*x)

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    ans = 6
    a = int(input())
    b = int(input())
    print(6 // a // b)

Submission status: Accepted

Solution code:
print(6//int(input())//int(input()))

Submission status: Accepted

Solution code:
A = input()
B = input()
if A=="1" and B=="2":
    print("3")
elif A=="1" and	B =="3":
    print("2")
elif A=="2" and	B=="1":
    print("3")
elif A=="2" and	B=="3":
    print("1")
elif A=="3" and	B=="1":
    print("2")
elif A=="3" and	B=="2":
    print("1")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print(list({1, 2, 3} - {a, b})[0])

Submission status: Accepted

Solution code:

A = int(input())
B = int(input())

print(list(set([1,2,3]) - set([A, B]))[0])

Submission status: Accepted

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

def main():
    *AB, = map(int, open(0).read().split())
    I = [1, 2, 3]
    C = set(I) - set(AB)
    print(list(C)[0])


main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print(6 - (a+b))

Submission status: Accepted

Solution code:
choice = [1, 2, 3]
wrongs = [0 for _ in range(2)]
wrongs[0] = int(input())
wrongs[1] = int(input())

choice.remove(wrongs[0])
choice.remove(wrongs[1])
print(choice[0])

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

print(6-(A+B))

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
c=a+b
if c==3:
	print("3")
elif c==4:
	print("2")
else:
	print("1")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a + b == 3:
    print(3)
elif a + b == 4:
    print(2)
else :
    print(1)

Submission status: Accepted

Solution code:
A, B = int(input()), int(input())
if A + B == 3: print(3)
elif A + B == 4: print(2)
else: print(1)

Submission status: Accepted

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

A = int(input())
B = int(input())

for i in [1, 2, 3]:
    if i != A and i != B:
        print(i)

Submission status: Accepted

Solution code:
s = [1,2,3]
i = int(input())
k = int(input())
s.remove(i)
s.remove(k)
print(s[0])

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a==1 and b==2 or b==1 and a==2:
    print(3)
elif a==1 and b==3 or b==1 and a==3:
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:

s = [1,2,3]
i = int(input())
k = int(input())
s.remove(i)
s.remove(k)
print(s[0])

Submission status: Accepted

Solution code:
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

A = ri()
B = ri()

c = set([1,2,3]) - set([A,B])
print(c.pop())

Submission status: Accepted

Solution code:
def main():
    A = int(input())
    B = int(input())
    print(6-(A+B))
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
noans = [int(input()) for i in range(2)]

if 1 in noans and 2 in noans:
    print(3)
elif 1 in noans and 3 in noans:
    print(2)
elif 2 in noans and 3 in noans:
    print(1)

Submission status: Accepted

Solution code:

A = int(input())
B = int(input())

for i in range(1, 4):
    if i != A and i != B:
        print(i)
        break

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if (A == 1 and B == 2) or (A == 2 and B == 1):
  print(3)
elif (A == 2 and B == 3) or (A == 3 and B == 2):
  print(1)
elif (A == 1 and B == 3) or (A == 3 and B == 1):
  print(2)

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
print(6-A-B)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
ans = [1,2,3]
for x in ans:
    if x !=a and x !=b:
        print(x)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
ans = [1, 2, 3]
ans.remove(a)
ans.remove(b)
print(ans[0])

Submission status: Accepted

Solution code:
import sys
a = int(sys.stdin.readline())
b = int(sys.stdin.readline())
print(6-a-b)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

for i in range(1, 4):
  if i == a or i == b:
    continue
  print(i)

Submission status: Accepted

Solution code:
A = {int(input())}
B = {int(input())}
l = {1, 2, 3}
print(list(l-A-B)[0])

Submission status: Accepted

Solution code:

A = int(input())
B = int(input())
if A != 1 and B != 1:
    print(1)
elif A != 2 and B != 2:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
c = 6-(a+b)
print(c)

Submission status: Accepted

Solution code:
a = int(input());
b = int(input());

ans = [1,2,3];

ans.remove(a)
ans.remove(b)

print(ans[0])

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

for i in range(1,4):
  if a != i and b != i:
    print(i)

Submission status: Accepted

Solution code:
import sys
import math
import itertools

a = int(input())
b = int(input())

for x in range(1, 4):
    if x == a: continue
    if x == b: continue
    print(x)

Submission status: Accepted

Solution code:
from math import sqrt
from decimal import Decimal
ans = [1,2,3]
A,B=int(input()),int(input())
ans.remove(A)
ans.remove(B)
print(ans[0])

Submission status: Accepted

Solution code:
AB=list([int(input()) for i in range(2)])
ABC=[1,2,3]
print(list(set(ABC)-set(AB))[0])

Submission status: Accepted

Solution code:
def main():
    print(6 - int(input()) - int(input()))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#copy

a = int(input())
b = int(input())

print(6 - a - b)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
C = {1,2,3}-{A,B}
print(list(C)[0])

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
c=6-a-b
print(c)

Submission status: Accepted

Solution code:
def main():
    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

    #inf = 10**17
    #mod = 10**9 + 7

    a = int(input())
    b = int(input())
    for i in range(1, 4):
        if i==a or i==b:
            continue
        print(i)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
l = [1,2,3]
for i in l:
  if i not in (A,B):
    print(i)
    break

Submission status: Accepted

Solution code:
#ライブラリの読み込み
import math

#入力値の格納
a = int(input())
b = int(input())

#表示
print(6-a-b)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
for i in range(1,4):
  if i != a and i != b:
    print(i)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
for i in range(1, 4):
    if i != a and i != b:
        print(i)

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())

s={A,B}
D={1,2,3}
for i in (D-s):
  print(i)

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a*b==2:
  print(3)
elif a*b==3:
  print(2)
else:
  print(1)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
ans = 6
print(ans-(a+b))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a == 1:
    if b == 2:
        print("3")
    elif b == 3:
        print("2")

elif a == 2:
    if b == 1:
        print("3")
    elif b == 3:
        print("1")

elif a == 3:
    if b == 1:
        print("2")
    elif b == 2:
        print("1")

Submission status: Accepted

Solution code:
from itertools import permutations as perm
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    A, B = input([int, 2])
    print(({1, 2, 3} - {A, B}).pop())


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

s = {1, 2, 3}
s.discard(a)
s.discard(b)
print(s.pop())

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

ans = 6 - a - b
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a+b==3:
  print(3)

elif a+b==4:
  print(2)

else:
    print(1)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

s = [1, 2, 3]

s.remove(A)
s.remove(B)

print(s[0])

Submission status: Accepted

Solution code:
a = input()
b = input()
ans = 6 - int(a) - int(b)
print(ans)

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a+b==3: print(3)
elif a+b==4: print(2)
else: print(1)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

l = [a,b]

if 1 not in l:
	print(1)
elif 2 not in l:
	print(2)
elif 3 not in l:
	print(3)

Submission status: Accepted

Solution code:
a = input()
b = input()

abc = "123"

abc = abc.replace(a, "")
abc = abc.replace(b, "")

print(abc)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if (a, b) == (1, 2) or (a, b) == (2, 1):
    print(3)
elif (a, b) == (1, 3) or (a, b) == (3, 1):
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

l = [1, 2, 3]
l.remove(A)
l.remove(B)
print(int(l[0]))

Submission status: Accepted

Solution code:
def q1():
    a = int(input())
    b = int(input())

    ans = [1, 2, 3]
    ans.remove(a)
    ans.remove(b)
    print(ans[0])


if __name__ == '__main__':
    q1()

Submission status: Accepted

Solution code:
# ABC148A - Round One

print([[],[0,0,3,2,],[0,3,0,1,],[0,2,1,0]][int(input())][int(input())])

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

c = 1 if a != 1 and b != 1 else (2 if a != 2 and b != 2 else 3)

print(c)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
l = [1, 2, 3]
l.remove(a)
l.remove(b)
print(l[0])

Submission status: Accepted

Solution code:
a = input()
b = input()
c = ['1','2','3']
c.remove(a)
c.remove(b)
print(c[0])

Submission status: Accepted

Solution code:
answer=[1,2,3]
a=int(input())
answer.remove(a)
b=int(input())
answer.remove(b)
print(answer[0])

Submission status: Accepted

Solution code:
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    AB = [ii() for _ in range(2)]
    ret = {1, 2, 3}
    print(*ret-set(AB))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l = [1,2,3]
a = int(input())
b = int(input())
l.remove(a);l.remove(b)
print(l[0])

Submission status: Accepted

Solution code:
x = int(input())
y = int(input())
print(6-x-y)

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
if A!=1 and B!=1:
    print(1)
elif A!=2 and B!=2:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
a, b = [int(input()) for _ in range(2)]
l = [1,2,3]
l.remove(a)
l.remove(b)
print(l[0])

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a==1 and b==2 or a==2 and b==1:
    print(3)
elif a==1 and b==3 or a==3 and b==1:
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a+b==3:
  print(3)
elif a+b==4:
  print(2)
else:
  print(1)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

s = {1,2,3}

q = {a, b}

print(list((s-q))[0])

Submission status: Accepted

Solution code:
a = [int(input())]
b = [int(input())]
l = [1, 2, 3]
ans = set(l) - set(a) -set(b)
print(list(ans)[0])

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a==1 and b==2 or a==2 and b == 1:print(3)
elif a==2 and b == 3 or a ==3 and b== 2:print(1)
elif a==3 and b == 1 or a==1 and b==3:print(2)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

list = [1, 2, 3]

for i in list:
    if i != A and i != B:
        print(i)

Submission status: Accepted

Solution code:
a = input()
b = input()
a = int(a)
b = int(b)
list = [1, 2, 3]

for i in list:
    if i != a and i !=b:
        print(i)

Submission status: Accepted

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

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
from itertools import count, cycle, repeat     # count(start[,step]), cycle(iter), repeat(elm[,n])
from itertools import groupby                  # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
from itertools import starmap                  # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    L = [True, True, True]
    L[ii()-1] = False
    L[ii()-1] = False
    for i in range(3):
        if L[i]:
            print(i+1)
          

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a=input()
b=input()
Lis=["1","2","3"]
for i in range(3):
  if a!=Lis[i] and b!=Lis[i]:
    print(Lis[i])

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A != 1 and B != 1:
    print(1)
elif A != 2 and B != 2:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a+b == 3: print(3)
elif a+b == 4: print(2)
else: print(1)

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    a=int(input())
    b=int(input())
    print(6-a-b)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a+b == 3:
    print(3)
elif a+b == 4:
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:
i = int(input())
j = int(input())

print(6 - (i + j))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a+b == 3:
    print(3)
elif a+b == 5:
    print(1)
else:
    print(2)

Submission status: Accepted

Solution code:
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))






A=input1()
B=input1()
ans=[1,2,3]
for i in ans:
	if i!=A and i!=B:
		print(i)
		break

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
from itertools import accumulate, permutations, combinations, product
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A = INT()
B = INT()
for i in range(1,4):
  if i != A and i != B:
    print(i)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
for i in range(1,4):
  if i!=a and i!=b: print(i)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a + b == 3:
    print(3)
elif a + b == 5:
    print(1)
else:
    print(2)

Submission status: Accepted

Solution code:
a = [int(input()) for i in range(2)]
for x in range(1,4):
    if not x in a:
        print(x)

Submission status: Accepted

Solution code:
a = int(input())
print(6-a-int(input()))

Submission status: Accepted

Solution code:
def main():
    a = int(input())
    b = int(input())
    for i in [1, 2, 3]:
        if (i != a) and (i != b):
            print(i)
    


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

list = [1, 2, 3]
list.remove(A)
list.remove(B)
print(list[0])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np


def solve(A: int, B: int):
    ans = np.array([1,2,3])
    ans[A-1]=0
    ans[B-1]=0
    print(ans.sum())

    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
l=[1,2,3]
a=0
for i in range(3):
    if l[i]!=A and l[i]!=B:
        a=l[i]
print(a)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
c = [1, 2, 3]

c.remove(a)
c.remove(b)

print(c[0])

Submission status: Accepted

Solution code:
print(6- int(input()) - int(input()))

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())

l=[1,2,3]

l.remove(A)
l.remove(B)

print(l[0])

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A == 1 and B == 2:
  print("3")
elif A == 1 and B == 3:
  print("2")
elif A == 2 and B == 1:
  print("3")
elif A ==3 and B == 1:
  print("2")
elif A == 3 and B == 2:
  print("1")
else:
  print("1")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

nums = [1, 2, 3]

nums.remove(A)
nums.remove(B)

print(nums[0])

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
lst = [1, 2, 3]
for i in lst:
    if a != i and b != i:
        print(i)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
for i in range(1,4):
    if i==a or i==b:
        continue
    else:
        print(i)

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())

print(6-a-b)

Submission status: Accepted

Solution code:
a, b = map(int, open(0).read().split())
print(6-a-b)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
c = 6
print(c // (a*b))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print(6 - a - b)

Submission status: Accepted

Solution code:
# A - Round One

A = int(input())
B = int(input())

print(6-A-B)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
print(6-(A+B))
'''
x = [1, 2, 3]
if A == x :
    print("yes")
else :
    print("no")
'''