Problem:
 Score : 100 points    Problem Statement AtCoder Inc. holds a contest every Saturday.  There are two types of contests called ABC and ARC, and just one of them is held at a time.  The company holds these two types of contests alternately: an ARC follows an ABC and vice versa.  Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.      Constraints  S is ABC or ARC .         Input Input is given from Standard Input in the following format:  S       Output Print the string representing the type of the contest held this week.        Sample Input 1 ABC      Sample Output 1 ARC  They held an ABC last week, so they will hold an ARC this week.

Solution (Python):
S = input()

if S == "ABC":
    print("ARC")

else:
    print("ABC")

Solution (Python):
S = input()
if S == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s = input()
print('ABC' if s[1]=='R' else 'ARC')

Solution (Python):
s = input()
if s[1] == 'B':
    print("ARC")
else:
    print("ABC")

Solution (Python):
S=input()

if S=='ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
S = input()
if(S == "ABC"):
    print("ARC")
elif(S== "ARC"):
    print("ABC")

Solution (Python):
print('ARC' if input() == 'ABC' else 'ABC')

Solution (Python):
S = input()

if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
s = input()

if s == 'ABC':
	print('ARC')
else:
  	print('ABC')

Solution (Python):
S = input()

if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()
print("ARC" if S == 'ABC' else "ABC")

Solution (Python):
S = input()

if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
if input()=="ABC":print('ARC')
else:print("ABC")

Solution (Python):
S = input()
print('ARC' if S[1]=='B' else 'ABC')

Solution (Python):
if input()=='ABC': print('ARC')
else: print('ABC')

Solution (Python):
s = input()
out = ('ABC', 'ARC')[s == 'ABC']
print(out)

Solution (Python):
def main():
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')
S = input()
main()

Solution (Python):
s = input() 

if s == 'ABC':
    print('ARC')
elif s == 'ARC':
    print('ABC')

Solution (Python):
s=input()

if s=="ABC":
    print("ARC")
elif s=="ARC":
    print("ABC")

Solution (Python):
a= input()
if a == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
A = input()
if A[1] == 'B':
    print('ARC')
else:
    print('ABC')

Solution (Python):
print('ABCARC'.replace(input(), ''))

Solution (Python):
S = ["ABC","ARC"]
print(S[S.index(input())-1])

Solution (Python):
S = input()
if S =='ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
a = input()
if a == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
s=input()

if s=="ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()

print('ABC' if S == 'ARC' else 'ARC')

Solution (Python):
S = input()
if S == 'ABC':
	print('ARC')
else:
	print('ABC')

Solution (Python):
s=input()
if s=="ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = str(input())
if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
s = input()
d = {'ABC': 'ARC', 'ARC': 'ABC'}
print(d[s])

Solution (Python):
s = input()
if s[1] == "B":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()

print("ARC" if s=="ABC" else "ABC")

Solution (Python):
def main():
    s = input()
    if s == 'ABC':
        print('ARC')
    else:
        print('ABC')
if __name__ == '__main__':
    main()

Solution (Python):
S = input()

if S=='ARC':
    print('ABC')
else:
    print('ARC')

Solution (Python):
s = input()
print("ABC" if s=="ARC" else "ARC")

Solution (Python):
s = str(input())
if s =='ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()
if S == 'ABC':
  print('ARC')
elif S == 'ARC':
  print('ABC')

Solution (Python):
s = input()

if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):

import numpy as np;
from numba import jit




if __name__ == '__main__':
    S = input()
    if S == "ABC":
        print("ARC")
    else:
        print("ABC")

Solution (Python):
import numpy as np;
from numba import jit




if __name__ == '__main__':
    S = input()
    if S == "ABC":
        print("ARC")
    else:
        print("ABC")

Solution (Python):
a=input()
if a[1]=="B":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()

if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()
if S == "ABC":
  print("ARC")
else:
  print('ABC')

Solution (Python):
def main():
  s=input()
  if s == "ABC" :
    print("ARC")
  else:
    print("ABC")

main()

Solution (Python):
S=input()
if S=="ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
s = input()

if s == "ABC":
    print("ARC")
elif s == "ARC":
    print("ABC")

Solution (Python):
s = input()
if s == 'ABC':
  print('ARC')
elif s == 'ARC':
  print('ABC')

Solution (Python):
s=input()
if(s=="ARC"):
    print("ABC")
elif(s=="ABC"):
    print("ARC")

Solution (Python):
S = input()
if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):

s=input()
if s=='ABC':
 print('ARC')
else:
 print('ABC')

Solution (Python):
a = input()
if a == "ARC":
  print("ABC")
else:
  print("ARC")

Solution (Python):
s = input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
cont = input()
if cont == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):

S = input()
if S == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
S = input()
if S == 'ARC':
	print('ABC')
else:
	print('ARC')

Solution (Python):
S = input()
print("ARC" if S == "ABC" else "ABC")

Solution (Python):
S = input()
print("{}".format("ARC" if S == "ABC" else "ABC"))

Solution (Python):
S=input()
if S=="ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()
 
if S == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s = input()
print('ABC' if s == 'ARC' else 'ARC')

Solution (Python):
s=input()

if s=='ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
a = input()
if a =='ABC':
    print('ARC')
else:
    print("ABC")

Solution (Python):
a = input()
if a =='ABC':
    print('ARC')
else:
    print("ABC")

Solution (Python):
print('AABRCC'[input()[1]!='R'::2])

Solution (Python):
S = input()

if S == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()
if s == "ABC":
	print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()

if s == "ABC":
    print("ARC")
elif s == "ARC":
    print("ABC")

Solution (Python):
S = input()

if S == "ABC" :
    print("ARC")

else :
    print("ABC")

Solution (Python):
S = input()
if S == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
a=input()
if a=="ARC":
  print("ABC")
else:
  print("ARC")

Solution (Python):
S = input()
if S[1] == 'B':
    print('ARC')
else:
    print('ABC')

Solution (Python):
s = input()
if s == 'ARC':
    print('ABC')
else:
    print('ARC')

Solution (Python):
s = str(input())
if s=="ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
s=str(input())
if s[1]=='B':
	print('ARC')
else:
	print('ABC')

Solution (Python):
S = input()

if S[1] == 'R':
    print('ABC')
else:
    print('ARC')

Solution (Python):
S = input()

if S.upper() == "ABC":
  print("ARC")
  
else:
  print("ABC")

Solution (Python):
S = input()

if S == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
S=input()
if S[1]=='B':
    print('ARC')
else:
    print('ABC')

Solution (Python):
def main():
    S = input()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')


if __name__ == '__main__':
    main()

Solution (Python):
s = input()

if s == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s = input()

if s[1] == 'B':
  ss = s.replace('B','R')
else:
  ss = s.replace('R','B')

print(ss)

Solution (Python):


s = input()

if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()

if S == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
S = input()

if S[1] == 'B':
    print("ARC")
elif S[1] == 'R':
    print("ABC")
else:
    None

Solution (Python):
s = input()
if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()
if S == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
string = input()
if(string == 'ABC'):
  print('ARC')
else:
  print('ABC')

Solution (Python):
S = input()

if S=='ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s= input()
if s == 'ABC':
  print('ARC')
elif s == 'ARC':
  print('ABC')

Solution (Python):
s = input()

if s == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s=input()

if s=='ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()
if S[1] == 'R':
    T = 'ABC'
else:
    T = 'ARC'

print(T)

Solution (Python):
S = input()
print('ABC' if S == 'ARC' else 'ARC')

Solution (Python):

S = str(input())
if S == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()
if s == "ABC": print("ARC")
else: print("ABC")

Solution (Python):
s = str(input())

if s == "ABC":
  	print("ARC")
else:
  	print("ABC")

Solution (Python):

import sys


def solve(S: str):
    if S == "ABC":
        print("ARC")
    else:
        print("ABC")
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)


if __name__ == "__main__":
    main()

Solution (Python):
a=input()

print("ABC" if a=="ARC" else "ARC")

Solution (Python):
S = input()

print('ABC' if S == 'ARC' else 'ARC')

Solution (Python):

S = input()

print("ABC" if S == 'ARC' else 'ARC')

Solution (Python):
s=str(input())
if s=='ABC':
    ans='ARC'
if s=='ARC':
    ans='ABC'
print(ans)

Solution (Python):
n=input()
if(n=="ABC"):
  print("ARC")
elif(n=="ARC"):
  print("ABC")

Solution (Python):
S = str(input())
contest = 'ABC'
if S == contest:
    print('ARC')
else:
    print(contest)

Solution (Python):
s = input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()
if S == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()
if s == "ARC":
	print("ABC")
else:
    print("ARC")

Solution (Python):
s = input()
if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()

if S =='ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
s = input()

if s == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
a = input()
if(a=="ABC"):
  print("ARC")
else:
  print("ABC")

Solution (Python):
S = input()

if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
s = input()
if s[1]=='B':
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()
if s == 'ARC':
    print('ABC')
else:
    print('ARC')

Solution (Python):
S = input()
if S == 'ABC':
    print('ARC')
elif S == 'ARC':
    print('ABC')

Solution (Python):
s = input()
s = str(s)
if s == "ABC":
  print("ARC")
elif s == "ARC":
  print("ABC")

Solution (Python):
s = input()
s = str(s)
if s == "ABC":
  print("ARC")
elif s == "ARC":
  print("ABC")

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe


def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe


def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
s=input()
if s=='ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe


def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe


def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe


def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
s = input()
if s == 'ARC':
    print('ABC')
else:
    print('ARC')

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe


def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe


def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
s = str(input())
if s=="ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe


def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):



import sys  
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools



sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe


def solve():
    s = input()
    if s == "ABC":
        print("ARC")
    else:
        print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
s=input()
if s == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
S = input()

if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
s=input()
if s=="ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
if input()=='ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s = input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):



s = input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()

if S == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):

s = str(input())


if s=='ABC' :
    print('ARC')

elif s=='ARC' :
    print('ABC')

Solution (Python):
S = input()

if S == "ARC":
    print("ABC")
else:
    print("ARC")

Solution (Python):
n = input()
if n[1]=="B":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()
if S == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
S = input()
if S == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()
if s[1] == 'B':
  print('ARC')
else:
  print('ABC')

Solution (Python):
print('ARC' if input()[1]=='B' else 'ABC')

Solution (Python):
s = input()
if s=="ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = str(input())

if S == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
s = input()
if s == 'ABC':
  print('ARC')
elif s == 'ARC':
  print('ABC')

Solution (Python):
print("AABRCC"[input()[1]=="B"::2])

Solution (Python):
s = input()
abc = "ABC"
arc = "ARC"

if s == abc:
    result = arc
else:
    result = abc
    
print(result)

Solution (Python):
S = input()
if S[1] == 'B':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S=input()

if S=="ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
input_line = input()
if input_line == 'ABC':
    print('ARC')
elif input_line == 'ARC':
    print('ABC')

Solution (Python):
A = input()

if A == "ABC":
    print("ARC")
elif A == "ARC":
    print("ABC")

Solution (Python):
S=input()
if S=="ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
import sys
readline = sys.stdin.readline


def main():
    print("A" + ("R" if readline().rstrip()[1] == "B" else "B") + "C")


if __name__ == '__main__':
    main()

Solution (Python):
s=input()
if s=="ABC":print("ARC")
else: print("ABC")

Solution (Python):
S = input()
if S == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
import sys
INF = 10**9
sys.setrecursionlimit(INF)


def main():
    s, = open(0).read().split()

    ans = 'ARC' if s == 'ABC' else 'ABC'
    print(ans)
    return(ans)


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

if S[1] == "B":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s  = input()

if s == "ABC":
    print('ARC')
else:
    print('ABC')

Solution (Python):
a = input()
if a == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
if input() == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
name = input()

if name == "ABC":
    print("ARC")
elif name == "ARC":
    print("ABC");

Solution (Python):
s = input()

if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()
if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
s = input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()
if s == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
s = input()
if s == 'ABC':
  print('ARC')
elif s == 'ARC':
  print('ABC')

Solution (Python):
S = input()

print('ABC' if S == 'ARC' else 'ARC')

Solution (Python):
S=input()

if S[1]=='B':
    next='ARC'
else:
    next='ABC'
print(next)

Solution (Python):
S = input()
if S=='ABC':
	print('ARC')
else:
	print('ABC')

Solution (Python):
print('ABC' if input() == 'ARC' else 'ARC')

Solution (Python):
S = input()
if S[1] == 'B':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s = input()
print("ARC" if s == "ABC" else "ABC")

Solution (Python):
S = input()

if S == "ABC":
    print("ARC")

elif S == "ARC" :
    print("ABC")

Solution (Python):
S = input()
if S == "ABC":
  print("ARC")
if S == "ARC":
  print("ABC")

Solution (Python):
S = input()

if S == 'ABC':
    print('ARC')
else: print('ABC')

Solution (Python):
s = input()
if(s == "ABC"):
    print("ARC", end="")
else:
    print("ABC", end="")

Solution (Python):
S = input()

dict = {'ABC': 'ARC', 'ARC':'ABC'}
print(dict[S])

Solution (Python):
S = input()

if S=="ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()
if S == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
print('ARC' if input() == 'ABC' else 'ABC')

Solution (Python):
a = input()
if a == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s=input()

if s=='ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
s = input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()
if s == 'ABC':
    print('ARC')
elif s == 'ARC':
    print('ABC')

Solution (Python):
S = input()
if (S == 'ABC'):
    print('ARC')
else:
    print('ABC')

Solution (Python):
s = input()
if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()
if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
def main():
    S = input()
    print("ABC" if S == "ARC" else "ARC")
    return


main()

Solution (Python):
print('ARC' if input()=='ABC' else 'ABC')

Solution (Python):
S = input()

if S[1] == 'B':
    print('ARC')
else:
    print('ABC')

Solution (Python):
a = input()
if(a == "ABC"):
  print("ARC")
else:
  print("ABC")

Solution (Python):
x = input()
if x == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
a = input()
if(a=="ABC"):
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()
if S[1] == "B":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()
if S == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()

if s == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s = input()

if s == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
S=input('')

if S in['ABC']:
  print('ARC')
else:
  print('ABC')

Solution (Python):
n=input()
if(n=="ABC"):
  print("ARC")
elif(n=="ARC"):
  print("ABC")

Solution (Python):
s=input()
if s=="ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
S = input()
print('ABC' if S == 'ARC' else 'ARC')

Solution (Python):
s = input()

if(s == 'ABC'):
    print('ARC')
else:
    print('ABC')

Solution (Python):
S=input()
if S=="ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
print("AARBCC"[input()!="ABC"::2])

Solution (Python):
S = input()

if S == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
s = raw_input()
if s == "ABC":
    print "ARC"
if s == "ARC":
    print"ABC"

Solution (Python):
S=input()
if S=='ARC':
  print('ABC')
else:
  print('ARC')

Solution (Python):
S = input()
if S == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
def main():
    S = input()
    if S == "ABC":
        print("ARC")
    else:
        print("ABC")


if __name__ == '__main__':
    main()

Solution (Python):
x = input()
if x == "ARC":
    print("ABC")
else:
    print("ARC")

Solution (Python):
S = input()

if S =='ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
S = input()

if S == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
s = input().rstrip()

if s[1]=='B':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()
if(S == 'ARC'):
  print("ABC")
else:
  print("ARC")

Solution (Python):
s = input()

if s == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()
if S == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
i = input()
if(i=='ABC'):
    print('ARC')
else:
    print('ABC')

Solution (Python):
s=input()
if s=='ABC':
  print('ARC')

elif s=='ARC':
  print('ABC')

Solution (Python):
s = input()
if s == "ARC":
    print("ABC")
elif s == "ABC":
    print("ARC")

Solution (Python):
s = input()

if s == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
s = input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
s = input()
if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
last=input()
if last=="ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
S = input()
if S[1]=='B':
    print("ARC")
else:
    print("ABC")

Solution (Python):
n = input()

if n == "ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
x = input()
if x == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
a=input()
if a=="ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
S = input()
if S == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
a=input()
if a[1] == 'B':
    print('ARC')
else:
    print('ABC')

Solution (Python):
s=input()
if s == "ABC":
    print("ARC")
else:
    print("ABC")