Problem:


Score: 100 points

Problem Statement

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

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

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

Print the correct choice for this problem.

Constraints

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

A and B are different.

Input

Input is given from Standard Input in the following format:

A
B

Output

Print the correct choice.

Sample Input 1

3
1

Sample Output 1

2

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

Sample Input 2

1
2

Sample Output 2

3



Sample input:
3
1


Sample output:
2

Submission status: Accepted

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

Submission status: Accepted

Solution code:
choice1 = int(input())
choice2 = int(input())

if choice1 == 1:
    if choice2 == 2:
        print(3)
    else:
        print(2)
elif choice1 == 2:
    if choice2 == 1:
        print(3)
    else:
        print(1)
elif choice1 == 3:
    if choice2 == 2:
        print(1)
    else:
        print(2)

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:
input = [input() for i in range(2)]
choices = [1, 2, 3]

if(input[0] == input[1]):
  raise ValueError("A shouldn't be the same as B")

for choice in choices:
  if(str(choice) in input):
    continue
  else:  
    print(choice) 
    break

Submission status: Accepted

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

ans = 6-a-b
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from math import ceil
from math import factorial
from collections import Counter
from operator import itemgetter
import bisect
ii = lambda: int(input())
iia = lambda: list(map(int,input().split()))
isa = lambda: list(input().split())

a = ii()
b = ii()

print(6-a-b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(6//(a*b))

Submission status: Accepted

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

print(ans.pop())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
array = list(range(1,4))
array.remove(int(input()))
array.remove(int(input()))
[print(i) for i in array]

Submission status: Accepted

Solution code:
A,B=open(0)
print(6-int(A)-int(B))

Submission status: Accepted

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

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

ans = 6-A-B

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(tmp[0])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:
    if a-1 == b and b > 1:
        print(a-b)
    elif a-1 == b:
        print(a+1)
    else:
        print(a-1)
else:
    if b-1 == a and a > 1:
        print(b-a)
    elif b-1 == a:
        print(b+1)
    else:
        print(b-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

print(6-a-b)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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())
nums = [1,2,3]
nums.remove(a)
nums.remove(b)
print(*nums)

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 = {1, 2, 3}
not_ans = {a, b}

for data in ans.difference(not_ans):
    print(data)

Submission status: Accepted

Solution code:
L = [input(), input()]
for i in range(1,4):
  if str(i) not in L:
    print(i)
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

h = [1,2,3]

h.remove(a)
h.remove(b)

print(h[0])

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
s = 1 + 2 + 3
print '{}'.format(s-A-B)

Submission status: Accepted

Solution code:
all_str = [1,2,3] 
cnt=0
select1 = int(input())
select2 = int(input())
for i in range(len(all_str)-1):
    j = i - cnt
    if all_str[j] == select1:
        all_str.pop(j)
        cnt += 1
    elif all_str[j] == select2:
        all_str.pop(j)
        cnt +=1
        
print(all_str[0])

Submission status: Accepted

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

print(C)

Submission status: Accepted

Solution code:

ans = [1,2,3]

a = int(input())
b = int(input())
ans.remove(a)
ans.remove(b)
print(ans[0])

Submission status: Accepted

Solution code:
AB = []

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num_list = [int(input()) for i in range(2)]
c = 6 - (num_list[0] + num_list[1])
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("123".translate(str.maketrans({input():"", input():""})))

Submission status: Accepted

Solution code:
def main():

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

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

    for i in ans: print(i)
    
    
main()

Submission status: Accepted

Solution code:
n = {1, 2, 3} - {int(input()) for _ in range(2)}
print(n.pop())

Submission status: Accepted

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

Submission status: Accepted

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

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

print(lst[0])

Submission status: Accepted

Solution code:
ans = set([1, 2, 3])
l = set()
for _ in range(2):
    l.add(int(input()))

print(list(ans-l)[0])

Submission status: Accepted

Solution code:
# coding: utf-8

A = int(input())
B = int(input())
array = []
array.append(A)
array.append(B)

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys


def main(argv=sys.argv):

    answers = ['1', '2', '3']

    a = input()

    answers.remove(a)

    b = input()

    answers.remove(b)

    print(answers[0])

    return 0


if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

Solution code:
# coding: utf-8
import sys


def main(argv=sys.argv):
  a = input()
  b = input()
  select = ['1', '2', '3']
  
  select.remove(a)
  select.remove(b)
  
  print(''.join(select))

  return 0


if __name__ == '__main__':
  sys.exit(main())

Submission status: Accepted

Solution code:
ans = {1, 2, 3}
for _ in range(2):
    a = int(input())
    ans.discard(a)
print(ans.pop())

Submission status: Accepted

Solution code:
answer = [1, 2, 3]

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

answer.remove(A)
answer.remove(B)

print(answer[0])

Submission status: Accepted

Solution code:
"""abc148"""
"""round one"""
num=[int(input()) for i in range(2)]
x=[1,2,3]
ans=set(x).difference(set(num))
print(list(ans)[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans_list[0])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line1 = input()
line2 = input()
#print(line1, line2)
items = ['1', '2', '3']
for i in items:
  if i != line1 and i != line2:
	  print(i)

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

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

figure = [1, 2, 3]

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

Submission status: Accepted

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

ans = [1,2,3]

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

print(ans[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:
a=int(input())
b=int(input())
c=a+b
if c==3:
    print(3)
elif c==4:
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
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())
Q = 6-A-B

print(Q)

Submission status: Accepted

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

Submission status: Accepted

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

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:
li = [1,2,3]
a = int(input())
b = int(input())
li.remove(a)
li.remove(b)
print(li[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())
c = a + b
print(6-c)

Submission status: Accepted

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

Submission status: Accepted

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

nums = [1,2,3]

del nums[nums.index(a)]
del nums[nums.index(b)]

print(nums[0])

Submission status: Accepted

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

Ans = list(range(1,4))
Ans.remove(A)
Ans.remove(B)

print(Ans[0])

Submission status: Accepted

Solution code:
a = {1, 2, 3}
a.remove(int(input()))
a.remove(int(input()))
print(list(a)[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:
import sys
input = sys.stdin.readline
A = int(input())
B = int(input())
li_ans = [3,2,1]
print(li_ans[(A+B)%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:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        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 combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    A = r_int()
    B = r_int()
    print(6-A-B)
    
    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if (f == 1 or f == 2) and (s == 1 or s == 2):
  print(3)
elif (f == 3 or f == 2) and (s == 3 or s == 2):
  print(1)
else:
  print(2)

Submission status: Accepted

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

all_a = [1,2,3]

all_a.remove(a)
all_a.remove(b)

print(all_a[0])

Submission status: Accepted

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

print(6 - (a + b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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())
nums = [1, 2, 3]
 
for n in nums:
  if((a != n) and (b != n)):
     print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = ["1","2","3"]

a.remove(input())
a.remove(input())
print(a[0])

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
for c in range(1, 4):
    if c != a and c != 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 == 3:
  print(1)
elif a == 2 and b == 1:
  print(3)
elif a == 3 and b == 2:
  print(1)
elif a == 3 and b == 1:
  print(2)