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

Solution (Python):
a, b = [int(input()) for _ in range(2)]

ans = sum([(i + 1) for i in range(3)])
ans -= a + b

print(ans)

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

Solution (Python):
def main():
    a = int(input())
    b = int(input())

    c = a * b
    if c == 2:
        print(3)
    elif c==3:
        print(2)
    else:
        print(1)


    
if __name__ == "__main__":
    main()

Solution (Python):
a,b=[int(input()) for _ in range(2)]
print((6//a)//b)

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

Solution (Python):
a=input()
b=input()
l='123'
l=l.replace(a,'')
l=l.replace(b,'')
print(l)

Solution (Python):














import math



INF = 10**18 
PI = math.pi

large_P = 1000000007








def my_pow(N, a, M):
    if(a == 0):
        return 1
    else:
        if(a % 2 == 0):
            tempo = my_pow(N, a/2, M)
            return (tempo * tempo) % M
        else:
            tempo = my_pow(N, a - 1, M)
            return (tempo * N) % M





def my_combination(N, a, M):
    res = 1

    for i in range(0, a):
        res *= N - i
        res %= M

    for i in range(0, a):
        res *= my_pow(i + 1, M - 2, M)
        res %= M

    return res





def my_combination_table(N, M, v):
    if(len(v) < N + 1):
        l = N + 1 - len(v)
        tempo = [1] * l
        v.extend(tempo)

    for i in range(1, N + 1):
        v[i] = v[i - 1] * (N - (i - 1))
        v[i] %= M

        v[i] *= my_pow(i, M - 2, M)
        v[i] %= M

    return








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

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

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

Solution (Python):
a=int(input())
b=int(input())
c=[1,2,3]
c.remove(a)
c.remove(b)
if c==[1]:
  print(1)
elif c==[2]:
  print(2)
else:
  print(3)

Solution (Python):
a=int(input())
b=int(input())
L=[a,b]
if 1 not in L:
  print(1)
elif 2 not in L:
  print(2)
else:
  print(3)

Solution (Python):
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)

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():
    A = int(input())
    B = int(input())
    ans = [1, 2, 3]
    ans.remove(A)
    ans.remove(B)
    print(ans[0])


if __name__ == '__main__':
    solve()

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

answers = [1, 2, 3]
answers.remove(a)
answers.remove(b)

print(answers[0])

Solution (Python):
def main():
    A = int(input())
    B = int(input())

    num = [1, 2, 3]

    num.remove(A)
    num.remove(B)

    print(*num)


if __name__ == "__main__":
    main()

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

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

Solution (Python):
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 == 2 and B == 3:
  print('1')
elif A == 3 and B == 1:
  print('2')
elif A == 3 and B == 2:
  print('1')

Solution (Python):
a = int(input())
b = int(input())
ns = [1, 2, 3]
ns = [n for n in ns if not n == a and not n == b]
print(ns[0])

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

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

Solution (Python):
A=["1","2","3"]
A.pop(A.index(input()))
A.pop(A.index(input()))
print(A[0])

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

A = [a,b]

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

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

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

C = [i for i in range(1, 4) if i != A and i != B]

print(*C)

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

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

Solution (Python):
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)
elif (a == 2 and b == 3) or (a == 3 or b == 2):
    print(1)

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

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

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

Solution (Python):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

def main():
    a = int(input())
    b = int(input())
    if a + b == 3:
        print(3)
        return
    elif a + b == 4:
        print(2)
        return
    print(1)
    
    
main()

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

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

Solution (Python):
ans = ["1","2","3"]
a = input()
b = input()
ans.remove(a)
ans.remove(b)
print("".join(ans))

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

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

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

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

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

Solution (Python):

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

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

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

print(6-a-b)

Solution (Python):
u={1,2,3}
AB=[int(input()) for i in range(2)]
print(list(u-set(AB))[0])

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

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

Solution (Python):
def main():
  num = [int(input()) for i in range(2)]
  print(6-num[0]-num[1])

main()

Solution (Python):
a = input()
b = input()
c = ['1','2','3']

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

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

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

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

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

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

Solution (Python):

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

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

Solution (Python):
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)

Solution (Python):
def func(A, B):
    ans = list({"1", "2", "3"} - {A, B})[0]
    return ans


if __name__ == "__main__":
    A, B = input(), input()
    print(func(A, B))

Solution (Python):
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)

Solution (Python):
ans = [1,2,3]
tmp = []

for i in range(2):
    tmp.append(int(input()))

for j in ans:
    if j not in tmp:
        print(j)

Solution (Python):
ans = [1, 2, 3]
tmp = []
for i in range(2):
    tmp.append(int(input()))
    
for j in ans:
    if j not in tmp:
        print(j)

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

answer = [1,2,3]
answer = set(answer)
wrong = set([A, B])

temp = answer - wrong 
print(temp.pop())

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

print(6- A - B)

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

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

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

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

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

ans = 0

if a == 1:
    if b == 2:
        ans = 3
    else:
        ans = 2
elif a == 2:
    if b == 1:
        ans = 3
    else:
        ans = 1
else:
    if b == 1:
        ans = 2
    else:
        ans = 1

print(ans)

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

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

print( 6 - A - B )

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

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

Solution (Python):

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    A, B = map(int, readlines())
    list = [1, 2, 3]
    list.remove(A)
    list.remove(B)
    print(list[0])


if __name__ == '__main__':
    main()

Solution (Python):


import sys

def input():
    return sys.stdin.readline().rstrip('\n')



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

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

print(C[0])

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

Solution (Python):
n=int(input())
m=int(input())
print(6-(n+m))

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

print(str(6 - A - B))

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

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

print([i+1 for i in range(3) if i+1 != A and i+1 != B][0])

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

Solution (Python):
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 == 2 and B == 3:
  print(1)
elif A == 3 and B == 1:
  print(2)
else:
  print(1)

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

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

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

Solution (Python):
print 6 - int(raw_input()) - int(raw_input())

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

Solution (Python):
a = input()
b = input()
c = ['1', '2', '3']
for i in c:
  if i != a and i != b:
    print(i)

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

print(6 - A - B)

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

ans = {1, 2, 3}
ans -= {A, B}
print(ans.pop())

Solution (Python):
ans=[1,2,3]
ab=[int(input()) for _ in range(2)]

print(*(set(ans)^set(ab)))

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

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

Solution (Python):
x = [int(input()) for i in range(2)]
print(6-x[0]-x[1])

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

print(6-A-B)

Solution (Python):
a = input()
b = input()
if '1' not in [a, b]:
  print('1')
if '2' not in [a, b]:
  print('2')
if '3' not in [a, b]:
  print('3')

Solution (Python):
c= '123'

a= str(input())
b= str(input())

c= c.replace(a, '')
c= c.replace(b, '')

print(c)

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

choices = [1, 2, 3]

choices.remove(A)
choices.remove(B)

print(*choices)

Solution (Python):
f = list(map(str, [1, 2, 3]))
f.remove(input())
f.remove(input())
print(f[0])

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

list = []

list.append(a)
list.append(b)

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

Solution (Python):
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

A=int(input())
B=int(input())
A2=min(A,B)
B2=max(A,B)
if(A2==1 and B2==2):
    print(3)
    sys.exit(0)

if(A2==2 and B2==3):
    print(1)
    sys.exit(0)

if(A2==1 and B2==3):
    print(2)
    sys.exit(0)

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

print(6-a-b)

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

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

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

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

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

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

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

Solution (Python):
a = int(input())
b = int(input())
l = [a,b]

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

Solution (Python):
a=int(input())
b=int(input())
c=[a,b]
if 1 not in c:
    print(1)
elif 2 not in c:
    print(2)
else:
    print(3)

Solution (Python):
ans={'1','2','3'}
a,b=input(),input()
print(*(ans-set([a,b])))

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

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

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

A = [1, 2, 3]
A[a-1]= 0
A[b-1] = 0
print(sum(A))

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

Solution (Python):
a=int(input())
b=int(input())
if a==3:
  print(3-b)
elif b==3:
  print(3-a)
else:
  print(3)

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

ans = 6 - a - b
print(ans)

Solution (Python):
A = input()
B = input()

KAI = "123"
KAI1 = KAI.replace(A,"")
KAI2 = KAI1.replace(B,"")
print(KAI2)

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

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

ans_list = [1, 2, 3]

ans_list.remove(a)
ans_list.remove(b)
print(ans_list[-1])

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

Solution (Python):
a=int(input())
b=int(input())
if a==3:
  print(3-b)
elif b==3:
  print(3-a)
else:
  print(3)

Solution (Python):
a, b = [int(input()) for _ in range(2)]
c = [1, 2, 3]
c.remove(a)
c.remove(b)
print(*c)

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

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

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

print(6-A-B)

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

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

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

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

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

A,B = map(int, read().split())
temp = [A,B]
 
for i in range(1,4):
  if i not in temp:
    print(i)

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

l = [A, B]
for i in range(1, 4, 1):
  if i not in l:
    print(i)
    break

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

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

Solution (Python):
select = list(range(1, 4))
a = int(input())
b = int(input())
ans = next(s for s in select if s != a and s != b)
print(ans)

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

out=[1,2,3]
out.remove(a)
out.remove(b)

print(out[0])

Solution (Python):
a=int(input())
b=int(input())
s=[0 for i in range(3)]
s[a-1] = 1
s[b-1] = 1
for i in range(3):
    if s[i]==0:
        print(i+1)

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

Solution (Python):
A = input()
B = input()
ref = '123'
for i in ref:
  if i != A and i != B:
    print(i)

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits, ascii_letters
from bisect import bisect, bisect_left
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)))
import numpy as np
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A = INT()
B = INT()

ans = [1, 2, 3]

for i in ans:
	if i not in [A, B]:
		print(i)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits, ascii_letters
from bisect import bisect, bisect_left
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)))
import numpy as np
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A = INT()
B = INT()

ans = list(range(1, 4))

ans.remove(A)
ans.remove(B)

print(ans.pop())

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

Solution (Python):
A=input()
B=input()

List=["1","2","3"]

del List[List.index(A)]
del List[List.index(B)]

print("".join(List))

Solution (Python):
import sys

a = input()
b = input()
c = 6- int(a)-int(b)

print(c)

Solution (Python):
choise = {1, 2, 3}
for i in range(2):
    choise.remove(int(input()))
print(list(choise)[0])

Solution (Python):
a = set([int(input()), ])
b = set([int(input()), ] )
c = set([1, 2, 3])
[print(i) for i in c - a - b]

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

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

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

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    a = int(input())
    b = int(input())
    print(*(set([1, 2, 3]) - set([a]) - set([b])))


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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

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

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

print(6-A-B)

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

Solution (Python):
WA = { int(input()), int(input())}
ans = {1, 2, 3} - WA
print(ans.pop())

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline

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

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


if __name__ == "__main__":
    main()

Solution (Python):

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 == 2 and b == 3:
    print(1)
elif a == 3 and b == 1:
    print(2)
elif a == 3 and b == 2:
    print(1)

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

ans = 0

for i in [1,2,3]:
    if i not in [a,b]:
        ans = i

print(ans)

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

Solution (Python):
a = 0
for i in range(2):
    a += int(input())
    
print(6-a)

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

Solution (Python):

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


Answer = list(set([1, 2, 3]) ^ set([A, B]))[0]

print(Answer)

Solution (Python):


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

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

Solution (Python):
A = int(input())
B = int(input())
lis = [1]*4
lis[A] = 0
lis[B] = 0
for i in range(1,4):
    if lis[i] == 1:
        print(i)

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

print(6 - A - B)

Solution (Python):
A, B = [int(input()) for i in range(2)]
l = [1, 2, 3]
l.remove(A)
l.remove(B)
print(l[0])

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

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

Solution (Python):
A = input()
B = input()

ans = set('123')
ans.remove(A)
ans.remove(B)
print(tuple(ans)[0])

Solution (Python):
S = int(input())
T = int(input())

if S != 1 and T != 1:
    print(1)
elif S != 2 and T != 2:
    print(2)
else:
    print(3)

Solution (Python):
A = int(input())
B = int(input())
if A*B == 2:
  print(3)
elif A*B == 3:
  print(2)
elif A*B == 6:
  print(1)

Solution (Python):
a = int(input())
b = int(input())
l = [1,2,3]
l.remove(a)
l.remove(b)
print(''.join(map(str,l)))

Solution (Python):
l = set([1,2,3])
A = int(input())
B = int(input())
d = set([A,B])
print((l - d).pop())

Solution (Python):
List=[1,2,3]
a=int(input())
b=int(input())
List.remove(a)
List.remove(b)
print(*List)

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

x = [1,2,3]

x[a-1] = 0
x[b-1] = 0

print(max(x))

Solution (Python):
import fileinput

aa = [1, 2, 3]

aa.remove(int(input()))
aa.remove(int(input()))

print(aa.pop())

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

Solution (Python):
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)

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

if __name__ == '__main__':

    ABC_148_A()

Solution (Python):
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')

Solution (Python):

"""
Created on Sat May  9 16:04:18 2020

@author: shinba
"""

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

print(6-a-b)

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

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

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

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

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

print(6 - (A + B))

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

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

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

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

Solution (Python):
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])

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

Solution (Python):
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)

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

print(6 - A - B)

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

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

Solution (Python):
choices = {'1', '2', '3'}

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

print(choices.pop())

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

Solution (Python):
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


import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
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()  
def LS(): return list(input())  
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")

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

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

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

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

Solution (Python):


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

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

Solution (Python):
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)

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

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

Solution (Python):


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

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

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

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

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

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

print(6-sum(List))

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

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

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

print(6-a-b)

Solution (Python):
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")

Solution (Python):
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()

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

print(6-A-B)

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

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

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

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

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

print(s.pop())

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

Solution (Python):
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")

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

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

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

Solution (Python):
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)

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

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

print(ansli[0])

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

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

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

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

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

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

print(solve())

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

Solution (Python):

"""
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

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

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

Solution (Python):
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()

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

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

Solution (Python):
ans = list("123")

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

print(int(ans[0]))

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

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

Solution (Python):
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)

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

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

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

print(test[0])