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

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = list - {A, B}
print(*ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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=[1,2,3]
A=int(input())
B=int(input())
for i in a:
  if not i==A and not i==B:
    print(i)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
def main():
    A = int(input())
    B = int(input())
    for i in range(1,4):
        if i != A and i != B:
            print(i)
            exit()

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

ans = [True]*3
ans[A-1]=False
ans[B-1]=False
for i in range(3):
    if ans[i]:
        print(i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
MOD = 10 ** 9 + 7
#input = sys.stdin.readline
import math
import itertools

#import bisect

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default


def main():
#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]
    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())
s = set()
s.add(A)
s.add(B)

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(A: int, B: int):
    if 1 not in [A, B]:
        print(1)
    elif 2 not in [A, B]:
        print(2)
    else:
        print(3)

    return


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:
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
# import numpy as np
# import scipy
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
 
def inp(): # n=1
    return int(input())
def inpm(): # x=1,y=2
    return map(int,input().split())
def inpl(): # a=[1,2,3,4,5,...,n]
    return list(map(int, input().split()))
def inpls(): # a=['1','2','3',...,'n']
    return list(input().split())
def inplm(n): # x=[] 複数行
    return list(int(input()) for _ in range(n))
def inpll(n): # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
    return [list(map(int, input().split())) for _ in range(n)]

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B):
    return 6 - (A+B)


def main():
    A = read_int()
    B = read_int()
    print(slv(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 not in (A, B):
        print(i)
        break

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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 1 not in [a,b]:print(1)
elif 2 not in [a,b]:print(2)
else:print(3)

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    a = int(readline())
    b = int(readline())
    for i in range(1, 4):
        if a != i and b != i:
            print(i)
            exit()


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce


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


a = IR(2)
for i in range(1, 4):
    if i not in a:
        print(i)
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

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

if not(1 in [a, b]):
    print(1)
elif not(2 in [a, b]):
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:

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

for i in range(3):

    i += 1
    if i != A and i != B:
        print (i)
        break

Submission status: Accepted

Solution code:
#%%
a = int(input())
b = int(input())
l = [a, b]
for i in range(1, 4):
    if i not in l:
        print(i)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
if 1 not in [A,B]:
	print(1)
elif 2 not in [A,B]:
	print(2)
else:
	print(3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,open(0))
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 i not in [a,b]:
        ans = i
print(ans)

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
ans=[1, 1, 1]
ans[A-1]=0
ans[B-1]=0
for i in range(3):
  if ans[i]==1:
    print(i+1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
minans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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 = 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)
x = ans.pop()
print(x)

Submission status: Accepted

Solution code:
a = input().strip()
b = input().strip()
print(6-int(a)-int(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())
if a+b == 3:
    print(3)
elif a+b==4:
    print(2)
elif a+b==5:
    print(1)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
s = set()
s.add(1)
s.add(2)
s.add(3)
for _ in range(2):
  s.discard(int(input()))
print(s.pop())

Submission status: Accepted

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

ls=[1,2,3]

ls.remove(a)
ls.remove(b)

print(ls[0])

Submission status: Accepted

Solution code:
import sys
import math
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a = I()
b = I()

ans = 6
print(ans - a - b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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

    print(1 ^ 2 ^ 3 ^ a ^ b)


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  l=[1,2,3]
  a=I()
  b=I()
  l.remove(a)
  l.remove(b)
  return l[0]

# main()
print(main())

Submission status: Accepted

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

from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

A = input()
B = input()
print 6 - A - B

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
A=int(input())
B=int(input())

print(6-A-B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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


# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np

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



print(6-a-b)

Submission status: Accepted

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

if not (1 in [a,b]):
    print(1)
elif not (2 in [a,b]):
    print(2)
elif not (3 in [a,b]):
    print(3)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
from itertools import count
from functools import lru_cache
from collections import defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#

def main():
    I = (ii(), ii())
    for i in (1,2,3):
        if i not in I:
            print(i)




main()

Submission status: Accepted

Solution code:
def solve():
    A=int(input())
    B=int(input())
    L=[1,2,3]
    L.remove(A)
    L.remove(B)
    return L[0]

print(solve())

Submission status: Accepted

Solution code:
A = {int(input()) for _ in range(2)}

print(*{1,2,3}-A)

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
l = [1, 2, 3]
for i in l:
  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 != 1: print(1)
elif A != 2 and B != 2: print(2)
else: print(3)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,b = IR(2)
    l = [i for i in [1,2,3]]
    for i in l:
        if i not in (a,b):
            print(i)
            return
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = 6 - A - B
print(ans)

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
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 n in [1, 2, 3]:
    if n != A and n != B:
        print(n)

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A=LIN(2)
    if 1 not in A:
        print(1)
    elif 2 not in A:
        print(2)
    else:
        print(3)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# 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())
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==4:
  print(2)
elif a+b==5:
  print(1)
elif a+b==3:
  print(3)

Submission status: Accepted

Solution code:
def main():

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

    return 6 - A - B


if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

ret = set([1, 2, 3])
ret.remove(A)
ret.remove(B)
print(*ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 6 - a - b

print(ans)

Submission status: Accepted

Solution code:
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# a, b = list(map(int, input().split()))
# s = input()

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

Submission status: Accepted

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

l = [True] * 3
l[a-1] = False
l[b-1] = False
print(l.index(True) + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

def main():
    A=int(input())
    B=int(input())
    print(6-(A+B))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


a, b = [int(sys.stdin.buffer.readline()) for _ in range(2)]
for i in range(1, 4):
    if i not in (a, b):
        print(i)
        break

Submission status: Accepted

Solution code:
import itertools, heapq, bisect
from collections import defaultdict as ddic, deque, Counter

rr = raw_input
rri = lambda: int(raw_input())
rrm = lambda: map(int, raw_input().split())
MOD = 10 ** 9 + 7

###
X = rri()
Y = rri()
print 6 - X-Y

Submission status: Accepted

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

Submission status: Runtime Error

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 or b == 2) :
  print(1)
else:
  pritn(2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B=map(int,input().split())
x = [A,B]
A = [1,2,3]
for idx in range(len(A)):
  if (A[idx] in x )== False:
    print(A[idx])
    break

Submission status: Runtime Error

Solution code:
A,B=map(int,input().split())
x = [A,B]
A = [1,2,3]
for idx in range(len(A)):
  if A[idx] in x == False:
    print(A[idx])
    break

Submission status: Runtime Error

Solution code:
A,B=map(int,input().split())
x = [A,B]
A = [1,2,3]
print(A[x in A == False])

Submission status: Runtime Error

Solution code:
A,B=map(int,input().split())
x=[1,2,3]
print(x[x!=A and x!=B])

Submission status: Runtime Error

Solution code:
A,B=map(int,input().split())
x=[1,2,3]
print(x(x!=A and x!=B))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
l=[1,2,3]
element=a,b not in element
print(element)

Submission status: Runtime Error

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

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=list(1,2,3)
c.pop(a)
c.pop(b)
print(c[0])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans.remove(a)
ans.remove(b)
print(ans[0])

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=[0]*n
c=1
for i in range(n):
  if a[i]==c:
    ans[i]=1
    c+=1
print(n-sum(ans))

Submission status: Runtime Error

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

t = set([1, 2, 3])
s = set([a,b])
ans = t - s
print(list(ans[0]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Solution code:
A=int(input())
B=int(input())
for i in raneg(3):
  if i+1 !=A && i+1 != B:
    print(i+1)

Submission status: Runtime Error

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

flag1 = True
flag2 = True
flag3 = True

if a = 1:
    flag1 = False
elif a = 2:
    flag2 = False
elif a = 3:
    flag3 = False
    
if b = 1:
    flag1 = False
elif b = 2:
    flag2 = False
elif b = 3:
    flag3 = False
    
if flag1:
    print(1)
elif flag2:
    print(2)
else:
    print(3)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A=[int(input()),int(input())]
if not 1 in A:
  print(1)
elif not 2 in A:
  print(2)
else not 3 in A:
  print(3)

Submission status: Runtime Error

Solution code:
i=int (input())
a=list(input().split(" "))
n=len(a[0])
for i in range(0,n):
    print(a[0][i]+a[1][i],end="")

Submission status: Runtime Error

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

print(6-a+b)

Submission status: Runtime Error

Solution code:
li=[1,2,3]
li.pop(int(input())-1)
li.pop(int(input())-1)
print(li[0])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<iostream>

using namespace std;

main(){
  int A,B;
  cin>>A>>B;
  if(A==1){
    if(B ==2)cout<<3<<endl;
    else cout<<2<<endl;
  }
  else if(A==2){
    if(B ==1)cout<<3<<endl;
    else cout<<1<<endl;
  }
  else{
    if(B ==2)cout<<1<<endl;
    else cout<<2<<endl;
  }
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
number=[1,2,3]
del number[A-1]
del number[B-1]
print(number[0])

Submission status: Runtime Error

Solution code:
A,B=map(int, input().split())
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: Runtime Error

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