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())
lis=[1,2,3]
lis.remove(a)
lis.remove(b)
print(lis[0])

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())
remain = 6 - (a + b)
print(remain)

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
import sys


def solve(A: int, B: int):
    print(6//A//B)
    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 = [1, 2, 3]
x, y = int(input()), int(input())
a.remove(x)
a.remove(y)
print(a[0])

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:
print("123".replace(input(), "").replace(input(), ""))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def judge(a, b):
  if a == 1:
    if b == 2:
      return 3
    else:
      return 2
  elif a == 2:
    if b == 1:
      return 3
    else:
      return 1
  else:
    if b == 1:
      return 2
    else:
      return 1

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

x = judge(a, b)

print(x)

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())

x = [1,2,3]

for i in x:
    if( i == a):continue
    if( i == b):continue
    print(i)

Submission status: Accepted

Solution code:
x = int(input())
y = int(input())
if x==1 and y==2:
    print(3)
elif x==1 and y==3:
    print(2)
elif x==2 and y==3:
    print(1)
elif x==2 and y==1:
    print(3)
elif x==3 and y==1:
    print(2)
elif x==3 and y==2:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding -*-
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:
#!/usr/bin/env python3
A = int(input())
B = int(input())
tmp = [1, 2, 3]
tmp.remove(A)
tmp.remove(B)
print(tmp[0])

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


def main():
    ans = [1,2,3]
    a = int(input())
    b = int(input())
    ans.remove(a)
    ans.remove(b)
    print(ans.pop())

if __name__ == '__main__':
    main()

Submission status: Accepted

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

# print(a)
# print(b)
# c = 6-a-b
# print(c)
c = int(a)
d = int(b)
e = 6-c-d
print(e)

Submission status: Accepted

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

Submission status: Accepted

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

print(6-int(A)-int(B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

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

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

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
a = A*B
print(6//a)

Submission status: Accepted

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

arr = [0] * 4
arr[a] = 1
arr[b] = 1
for i in range(1,4):
    if arr[i] == 0:
        print(i)

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    a = int(input())
    b = int(input())
    print(6 - (a + b))



if __name__ == '__main__':
    main()

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())

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

print(*l)

Submission status: Accepted

Solution code:
def main():
    x=[1,2,3]
    a=int(input())
    b=int(input())
    x.pop(x.index(a))
    x.pop(x.index(b))
    print(x.pop())

main()

Submission status: Accepted

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

Submission status: Accepted

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

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())

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

print(ans[0])

Submission status: Accepted

Solution code:
f = int(input())
s = int(input())

lst = [1, 2, 3]
lst.remove(f)
lst.remove(s)

print(lst[0])

Submission status: Accepted

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

if A == 1:
    if B == 2:
        ans = 3
    if B == 3:
        ans = 2
elif A == 2:
    if B == 1:
        ans = 3
    if B == 3:
        ans = 1
elif A == 3:
    if B == 1:
        ans = 2
    if B == 2:
        ans = 1

print(ans)

Submission status: Accepted

Solution code:
import sys
ans=[1,2,3]
ans.remove(int(sys.stdin.readline()))
ans.remove(int(sys.stdin.readline()))
print(*ans)

Submission status: Accepted

Solution code:
a = 0
for i in range(2):
  a += int(input())
if a == 3:
  print(3)
elif a == 5:
  print(1)
else:
  print(2)

Submission status: Accepted

Solution code:
n=int(input())
l=int(input())

print(6-n-l)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,B=input(),input()
for i in ('1','2','3'):
    if i not in (A,B):
        print(i)

Submission status: Accepted

Solution code:
if __name__ == '__main__':

	arr = [1,2,3]
	chk = [int(input()) for _ in range(2)]
	print(*(set(arr) ^ set(chk)))

Submission status: Accepted

Solution code:
s = [input() for i in range(2)]
a = int(s[0])
b = int(s[1])

print(6-a-b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
se = set([1,2,3])
AB = set([int(input()) for _ in range(2)])
ans = se-AB
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)
elif a+b == 5:
    print(1)

Submission status: Accepted

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

Cor = 6-(int(A)+int(B))
print(Cor)

Submission status: Accepted

Solution code:
a = 0
a += int(input())
a += int(input())

print(6 - a)

Submission status: Accepted

Solution code:
def main():
    A = int(input())
    B = int(input())
    if A > B:
        A, B = B, A

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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()

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

Submission status: Accepted

Solution code:
a=input()
b=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())

answer_list = [1,2,3]

answer_list.remove(a)
answer_list.remove(b)

print(answer_list[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

print(tmp[0])

Submission status: Accepted

Solution code:
l = []
l.append(input())
l.append(input())
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 = int(input())
B = int(input())
print(list({1,2,3}-{A,B})[0])

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:
A=input()
B=input()

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

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)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
n_list = [1, 2, 3]
n_list.remove(A)
n_list.remove(B)
for num in n_list:
  print(num)

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:
import sys
input=sys.stdin.readline

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

print(6-a-b)

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 == 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())

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

print(int(list(c)[0]))

Submission status: Accepted

Solution code:
sum=int(input()) + int(input())
print('1' if sum==5 else '2' if sum==4 else '3')

Submission status: Accepted

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

Submission status: Accepted

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

if 1 not in i:
  print("1")
elif 2 not in i:
  print("2")
else:
  print("3")

Submission status: Accepted

Solution code:
print(6 - sum(int(input()) for _ in range(2)))

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:
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:
import sys
row = sys.stdin.readline
def read_int(row):
    return int(row().rstrip())

A,B= [read_int(row) for i in range(2)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Round One

S = {1, 2, 3}
a, b = int(input()), int(input())

S.remove(a)
S.remove(b)

for s in S:
    print(s)

Submission status: Accepted

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

sum_ab = a + b
if sum_ab == 3:
  ans = 3
elif sum_ab == 4:
  ans = 2
elif sum_ab == 5:
  ans = 1

print(ans)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
ans = 0
if A == 1:
    if B == 2:
        ans = 3
    elif B == 3:
        ans = 2

elif A == 2:
    if B == 1:
        ans = 3
    elif B == 3:
        ans = 1

elif A == 3:
    if B == 1:
        ans = 2
    elif B == 2:
        ans = 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
flag=[0,0,0]
flag[A-1]=1
flag[B-1]=1
cnt=1;
for i in flag:
    if i==0:
        print(cnt)
        break
    cnt+=1

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

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 == 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(6-A-B)

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!=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==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 = input()
b = input()

print("123".replace(a,"").replace(b,""))

Submission status: Accepted

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

list_right = [1, 2, 3]

list_right.remove(a)
list_right.remove(b)

print(list_right[0])

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())

choices = [True for _ in range(4)]

choices[a] = False
choices[b] = False

for i in range(1,4):
    if choices[i] == True:
        print(i)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)

def main():
    a = ni()
    b = ni()

    print(6 - a - b)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:


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

print(str(6-A-B))

Submission status: Accepted

Solution code:
#Round One
A = int(input())
B = int(input())
answer = 6 - A - B
print(answer)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
ans_list = [1, 2, 3]

ans = [i for i in ans_list if i != A and i != B]
print(ans[0])

Submission status: Accepted

Solution code:
import sys
 
if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
 
 
a=int(input())
b=int(input())
	  
print(6//(a*b))

Submission status: Accepted

Solution code:
ans = set(range(1, 4))
ans -= {int(input())}
ans -= {int(input())}
print(*ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
if __name__ == '__main__':
    kouho = [1, 2, 3]
    a = int(input())
    b = int(input())
    kouho.remove(a)
    kouho.remove(b)
    print(kouho[0])

Submission status: Accepted

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

print(int(6/A/B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = [1, 2, 3]
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())
print(int(list(set([1, 2, 3]) - set([a, b]))[0]))

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:
A = int(input())
B = int(input())
print(list(set(range(1, 3 + 1)) - {A, B})[0])

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

wrong = [A, B]

for i in range(1,4):
  if str(i) in wrong:
    pass
  else:
    print(i)

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 permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()

ans = [1, 2, 3]

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

Submission status: Accepted

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

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())
for i in range(1,4):
  if not(i==a or i==b):
    print(i)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(6-int(input())-int(input()))

Submission status: Accepted

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

s = set([1, 2, 3])

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

print(s.pop())

Submission status: Accepted

Solution code:
n=int(input())
k=int(input())
print(6-(n+k))

Submission status: Accepted

Solution code:
print(6 - sum([int(input()) for _ in range(2)]))

Submission status: Accepted

Solution code:
import sys

a = int(input())
b = int(input())
for i in range(1,4):
  if i != a:
    if i != b:
      print(i)
      sys.exit()
  continue

Submission status: Accepted

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

Submission status: Accepted

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

questions = [1, 2, 3]
print([i for i in questions if i not in (a, b)][0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = (int(input()) for _ in range(2))
print(6-a-b)

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())

x = [e for e in range(1,4)]
x.remove(A)
x.remove(B)
print(x[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
val = {1, 2, 3}
val.remove(int(input()))
val.remove(int(input()))
print(list(val)[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=[1,2,3]

for i in range(3):
  if C[i]!=A and C[i]!=B:
    print(C[i])

Submission status: Accepted

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

if a in (1,2) and b in (1,2):
  print(3)
elif a in (2,3) and b in (2,3):
  print(1)
else:
  print(2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(input())]
a.append(int(input()))
for i in [1,2,3]:
    if i not in a:
        print(i)
        exit()

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
import numpy as np
import collections

#X = str(raw_input()).split()
A = int(raw_input())
B = int(raw_input())
C = 6

C-=A
C-=B


print(C);

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

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())
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())
b=int(input())
print (list(set([1,2,3])-set([a,b]))[0])

Submission status: Accepted

Solution code:
ab = []
for i in range(2):
    ab.append(int(input()))

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

Submission status: Accepted

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

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())

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

Submission status: Accepted

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

Submission status: Accepted

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

if (a!=1) & (b!=1):
    print(1)
elif (a!=2) & (b!=2):
    print(2)
else :
    print(3)

Submission status: Accepted

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

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:
import os

def main():
    list = [1,2,3]
    for i in range(2):
        num = int(input())
        list.remove(num)
    num_n = list[0]
    print(num_n)

if __name__ == "__main__":
    main()

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())

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

Submission status: Accepted

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

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())

ans = ''
for i in range(1,4):
  if i not in [a,b]:
    ans = i

print(ans)

Submission status: Accepted

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

X=[1,2,3]
X.remove(A)
X.remove(B)
print(int(sum(X)))

Submission status: Accepted

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

    result = [1, 2, 3]

    result.remove(A)
    result.remove(B)

    print(result[0])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding utf-8 -*-

L = [1,2,3]
a = int(input())
b = int(input())

L.remove(a)
L.remove(b)

print(L[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())

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)

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
print(abs(a-b) if a==3 or b==3 else 3)

Submission status: Accepted

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

Submission status: Accepted

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

li = [1,2,3]

li.remove(a)
li.remove(b)

print(li[0])

Submission status: Accepted

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

N = [1,2,3]

N.remove(A)
N.remove(B)

print(*N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = [int(input()) for i in range(2)]

C = 1
while C <= 3:
    if A != C and B != C:
        print(C)
        break
    else:
        C = C + 1

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
ar = ["1","2","3"]
ar.remove(input())
ar.remove(input())
print(ar[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())

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

print(ans.pop())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
choices = [1,2,3]
choices.remove(A)
choices.remove(B)
print(choices[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 == 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:
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)
else:
  if B == 1:
    print(2)
  elif B == 2:
    print(1)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(6-(a+b))

Submission status: Accepted

Solution code:
a = input()
b = input()
if {a, b} == {"1", "2"}:
    print("3")
elif {a, b} == {"1", "3"}:
    print("2")
else:
    print("1")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a_list = [1, 2, 3]

a_list.remove(a)
a_list.remove(b)

print(a_list[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
no_of_lines = 2
lines = ""
for i in range(no_of_lines):
    lines+=input()+"\n"

lines = lines.splitlines()
a = int(lines[0])
b = int(lines[1])

print(6-a-b)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    num1 = str(input())
    num2 = str(input())
    str = "123"
    str = str.replace(num1, '').replace(num2, '')
    print(str)

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:
a, b = int(input()), 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())

r = list(filter(lambda x: x != A and x != B, [1, 2, 3]))
print(r[0])