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()[1]
if S=='B':
  print('ARC')
else:
  print('ABC')

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

Solution (Python):
lastWeek = input()

thisWeek = "ABC" if (lastWeek == "ARC") else "ARC"

print(thisWeek)

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):
print('A'+'RB'[input()=='ARC']+'C')

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

Solution (Python):
date=input()

if date=="ABC":
    print("ARC")
elif date=="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):
a = input()
if(a == "ABC"):
    print('ARC')
else:
    print('ABC')

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

Solution (Python):
a = dict()
a['ARC'] = 'ABC'
a['ABC'] = 'ARC'
s = input()
print(a[s])

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

Solution (Python):
def nextweek(S):
  if( S == "ABC"):
    return "ARC"
  else:
    return "ABC"



S = input()
print (nextweek(S))

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

Solution (Python):
import time
startTimeProblem=time.time()

import fileinput, sys, itertools, functools
from math import *
from bisect import *
from heapq import *
from collections import *

def lcm(a, b):  
    return (a*b)/gcd(a, b)

class InputHelper:
    def __init__(self):
        self.myinput = fileinput.input()

    def isLocal(self):
        return not fileinput.isstdin()

    def int(self):
        return int(self.myinput.readline().rstrip())

    def ints(self):
        return [int(_) for _ in self.myinput.readline().rstrip().split()]

    def str(self):
        return self.myinput.readline().rstrip()

    def strs(self):
        return [_ for _ in self.myinput.readline().rstrip().split()]

class OutputHelper:
    def int(self, a):
        print(a)    

    def ints(self, a):  
        print(" ".join([str(_) for _ in a]))
    
    def intsNL(self, a):
        for _ in a:
            print(_)
    
    def str(self, s):
        print(s)

    def strs(self, s):
        print(" ".join([_ for _ in s]))

    def strsNL(self, s):
        for st in s:
            print(st)

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None

In = InputHelper()
Out = OutputHelper()



if In.str() == "ABC":
    Out.str("ARC")
else:
    Out.str("ABC")


        


if len(sys.argv)>2 and sys.argv[2]=="TIMEIT":
    fin = (time.time()-startTimeProblem)*1000
    print("{:.2f}".format(fin) + "ms")

Solution (Python):
import sys

def solve():
    S = input().strip("\n")
    if S[1] == "B": print("ARC")
    else: print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
def nextweek(S):
  if( S == "ABC"):
    return "ARC"
  else:
    return "ABC"



S = input()
print (nextweek(S))

Solution (Python):
input_l = input()

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

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()
dic = {}
dic["ARC"] = "ABC"
dic["ABC"] = "ARC"
print(dic[s])

Solution (Python):
s = input()
dic = {}
dic["ARC"] = "ABC"
dic["ABC"] = "ARC"
print(dic[s])

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

s = read().rstrip().decode()

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

Solution (Python):
print({"ABC": "ARC", "ARC": "ABC"}[input()])

Solution (Python):
B = 'ABC'
R = 'ARC'

S = input()

if S==B:
    print(R)
else:
    print(B)

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

s = read().rstrip().decode()
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()
print("ABC" if S[1] == 'R' else "ARC")

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

Solution (Python):
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



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):
list=["ABC","ARC"]
a=input()
if a==list[0]:
      print(list[1])
else:
      print(list[0])

Solution (Python):

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

Solution (Python):
print(["ARC","ABC"]["R" in input()])

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):
if input() == "ABC":
    print("ARC")
else:
    print("ABC")

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

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = input()

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

if __name__ == '__main__':
    main()

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

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

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

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()
print("ABC"if S=="ARC"else"ARC")

Solution (Python):
s = input()

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

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

Solution (Python):
print(["ABC","ARC"][input()=="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):
import sys
input = sys.stdin.readline



def linput(_t=int):
    return list(map(_t, input().split()))

def gcd(n,m):
    while m: n,m = m, n%m
    return n

def lcm(n,m): return n*m//gcd(n,m)

def main():

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

    


main()

Solution (Python):
print('A'+'BR'[input()=='ABC']+'C')

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    print("ABC" if input() == "ARC" else "ARC")
resolve()

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

Solution (Python):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  
from math import gcd

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

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

Solution (Python):
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


S = input()

print('ARC' if S == 'ABC' else '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):
a=input()
if a=='ABC':
  print('ARC')
if a=='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().strip()
if s[1] == "B":
    print("ARC")
else:
    print("ABC")

Solution (Python):
contest = input()

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

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

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

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

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

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

Solution (Python):
I = input()

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

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

if readline().strip() == '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')
else:
  print('ABC')

Solution (Python):

a = "ABC"
b = "ARC"
S = input()

if S == a:
    print(b)
else:
    print(a)

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


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

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

Solution (Python):
a = input()
if a == "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')
else:
  print('ABC')

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

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

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


if __name__ == '__main__':
    main()

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

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

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):
i=str(input())
if i=="ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):


import sys
import pprint

sys.setrecursionlimit(10 ** 6)

class Logger:
	def __init__(self, debug):
		self.debug = debug
	def print(self, *args):
		if self.debug:
			pprint.pprint(args)


def main():
	log = Logger(1)
	s = sys.stdin.readline().rstrip()
	if s == "ABC":
		print("ARC")
	else:
		print("ABC")
	


main()

Solution (Python):
s=input()

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

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

Solution (Python):
s = input()
b = "ABC"
r = "ARC"

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

Solution (Python):
print('AARBCC'[input()>'AC'::2])

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 == 'ABC':
  print('ARC')
else:
  print('ABC')

Solution (Python):
def main():

    S = input()

    if S == 'ABC':
        print('{}'.format('ARC'))
    else:
        print('{}'.format('ABC'))


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

import math
input = sys.stdin.readline

hoge = str(input().strip())
if hoge == "ABC":
   print("ARC".strip())
if hoge == "ARC":
       print("ABC".strip())

Solution (Python):
data = input()

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

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

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

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):
x = input()
if x == "ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    s = list(input())
    a = list('ABC')
    if s == a:
        print('ARC')
        exit()
    else:
      print('ABC')
    

if __name__ == '__main__':
    solve()

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

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

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

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

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

Solution (Python):








def main():
    
    

    S = input()

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


if __name__ == "__main__":
    main()

Solution (Python):

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


if __name__ == "__main__":
    main()

Solution (Python):
def main():
    if input() == '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 = str(input())
if s=="ABC":
  print("ARC")
else:
  print("ABC")

Solution (Python):
str = input()

if str == '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()
arc = "ARC"
abc = "ABC"
if S == arc:
    print(abc)
elif S == abc:
    print(arc)

Solution (Python):
S = input()

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

Solution (Python):
word = input()

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

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

Solution (Python):
data = input()

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

Solution (Python):
n = input()

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

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

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

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

Solution (Python):

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

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()
print('ABC') if S == 'ARC' else print('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")
else:
  print("ABC")

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

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):
s = str(input()) 
if  str(s) == "ABC": 
   print("ARC") 
elif str(s) == "ARC": 
   print("ABC")

Solution (Python):
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            a,b,c=(inp+[1])[:3]
            org_inp.append(inp)
        else:
            index=0
            a,b,c=(ls[i]+[1])[:3]
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'

    mp=[boundary]*(w+2);found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)];rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase

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

class Comb:
    def __init__(self,n,mo=10**9+7):
        self.fac=[0]*(n+1)
        self.inv=[1]*(n+1)
        self.fac[0]=1
        self.fact(n)
        for i in range(1,n+1):
            self.fac[i]=i*self.fac[i-1]%mo
            self.inv[n]*=i
            self.inv[n]%=mo
        self.inv[n]=pow(self.inv[n],mo-2,mo)
        for i in range(1,n):
            self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
        return
    
    def fact(self,n):
        return self.fac[n]
        
    def invf(self,n):
        return self.inv[n]

    def comb(self,x,y):
        if y<0 or y>x:
            return 0
        return self.fac[x]*self.inv[x-y]*self.inv[y]%mo

class Tree:
    def __init__(self,inp_size=None,init=True):
        if init:
            self.stdin(inp_size)
        return

    def stdin(self,inp_size=None):
        if inp_size==None:
            self.size=int(input())
        else:
            self.size=inp_size
        self.edges,_=GI(self.size,self.size-1)
        return
    
    def listin(self,ls):
        self.size=len(ls)+1
        self.edges,_=GI(self.size,self.size-1,ls)
        return

    def __str__(self):
        return  str(self.edges)

    def dfs(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
        q=deque()
        q.append(x)
        v=[-1]*self.size
        v[x]=root_v
        while q:
            c=q.pop()
            for nb,d in self.edges[c]:
                if v[nb]==-1:
                    q.append(nb)
                    v[nb]=func(v[c],nb,d)
        return v

    def EulerTour(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
        q=deque()
        q.append((-1,x))
        v=[None]*self.size
        v[x]=root_v
        et=[]
        while q:
            cb,ce=q.pop()
            et.append(ce)
            for nb,d in self.edges[ce]:
                if v[nb]==None:
                    q.append((nb,ce))
                    q.append((ce,nb))
                    v[nb]=func(v[ce],nb,d)
        vid=[[-1,-1]for i in range(self.size)]
        for i,j in enumerate(et):
            if vid[j][0]==-1:
                vid[j][0]=i
            else:
                vid[j][1]=i
        return v,et,vid
    
    def LCA_init(self,depth,et):
        self.st=SegTree(self.size*2-1,func=min,ide=inf)
        for i,j in enumerate(et):
            self.st.update(i,j)
        self.LCA_init_stat==True
        return
    
    def LCA(self,root,x,y):
        if self.LCA_init_stat==False:
            depth,et,vid=self.EulerTour(root)
            self.LCA_init(depth,et)
        return self.st.query(x,y+1)

show_flg=False
show_flg=True


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

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

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 = 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 == '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):
n = input()
if n == 'ABC':
    print ('ARC')
else:
    print ('ABC')

Solution (Python):
a=input()
if a=="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")
if s=="ARC":
  print("ABC")

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

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

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

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

print(ans)

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):
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("A"+"BR"[input()<"ARC"]+"C")

Solution (Python):
import sys

if __name__ == "__main__":
    line1 = sys.stdin.readline().strip()

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

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

if __name__ == '__main__':
    main()

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

Solution (Python):

A=str(input())
result=""


if A=="ABC":
    result="ARC"
else:
    result="ABC"

print(result)

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

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

Solution (Python):
S = input()

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

Solution (Python):
multi = str(input())
if multi == '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):
print("ARC" if input() == "ABC" else "ABC")

Solution (Python):
x = input()

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

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

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

Solution (Python):


"""
Created on Sun May  3 21:35:36 2020

@author: nanasakiwataru
"""

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

Solution (Python):
s = input()

abc = 'ABC'
arc = 'ARC'

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

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

Solution (Python):
import sys

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

S = read().rstrip().decode()
x = ['ABC', 'ARC']
x.remove(S)
print(x[0])

Solution (Python):
S = input()

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

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

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

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

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

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

Solution (Python):
str = input()
if str == 'ABC':
    print('ARC')
elif str == '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):
x = input()
if x == 'ABC':
    print('ARC')
if x == 'ARC':
    print('ABC')

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

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

Solution (Python):
s = input()

if 'ABC' == s :
    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):
contest_1 = "ABC"
contest_2 = "ARC"

S = input()

if S == contest_1:
    print(contest_2)
else:
    print(contest_1)

Solution (Python):




s=str(input())

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

Solution (Python):
s = input()

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

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

Solution (Python):
a, b, c = input()
if b=='R':
  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()
print("ARC" if s == "ABC" else "ABC")

Solution (Python):

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

if __name__ == '__main__':
    start()

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


if __name__ == '__main__':
  main()

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

if c == "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 = str(input())
if S == "ABC" : print("ARC")
else : print("ABC")

Solution (Python):
print("ABC" if input() == "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 = input()

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

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

Solution (Python):
str = input()
def kaisai(x):
	if str == "ABC":
  		kaisai = "ARC"
	elif str == "ARC":
  		kaisai = "ABC"
	return kaisai
print(kaisai(str))

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

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

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

Solution (Python):
print('ABC' if input()=='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")
if S=="ARC":
    print("ABC")