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

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

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

Solution (Python):

def input_from_console():
    s = input().rstrip()
    return s


def solve(s):
    if s == "ARC":
        return "ABC"
    return "ARC"

def main():
    s = input_from_console()
    print(solve(s))


if __name__ == "__main__":
    import sys

    if sys.gettrace():  
        check_cases()
    else:
        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")
else:
  print("ABC")

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

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

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

Solution (Python):
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest, nsmallest
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction



mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(" ".join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


s = data()
if s == "ABC":
    out("ARC")
    exit()
out("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")
else:
    print("ABC")

Solution (Python):

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

Solution (Python):
S=input()

if S[1]=='R':
  S="ABC"
else:
  S="ARC"

print(S)

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)


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


def main():
    S = input().strip()
    print("ABC" if S == "ARC" else "ARC")
    return


if __name__ == '__main__':
    main()

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

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

Solution (Python):

import numpy as np

s = str(input())

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

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

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

contest=["ABC","ARC"]

if S==contest[0]:
    print(contest[1])
else:
    print(contest[0])

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 = str(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
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


def main():
    s = input().strip()
    if s == 'ABC':
        print('ARC')
    else:
        print('ABC')


main()

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

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

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

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

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

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

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):
"""
AtCoder 社は、毎週土曜日にコンテストを開催しています。
コンテストには ABC と ARC の 2 つの種類があり、毎週どちらか一方が開催されます。
ABC が開催された次の週には ARC が開催され、ARC が行われた次の週には ABC が開催されます。

先週開催されたコンテストを表す文字列 S が与えられるので、今週開催されるコンテストを表す文字列を出力してください。
"""
s = input()
ans = 'ABC'
if s == 'ABC':
    ans = 'ARC'

print(ans)

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

Solution (Python):

S = input()

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

Solution (Python):
k =input()

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

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

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
C=str(input())
if C == "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')

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

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

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

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

Solution (Python):
a=input()

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

Solution (Python):

MOD = 10 ** 9 + 7
RLIMIT = 1000
DEBUG = 1

def main():
    for _ in inputt(1):
        s, = inputs()
        if s == "ARC":
            print("ABC")
        else:
            print("ARC")









from math import *
from heapq import *
from itertools import *
from functools import reduce, lru_cache, partial
from collections import Counter, defaultdict
import re, copy, operator, cmath
import sys, io, os, builtins
sys.setrecursionlimit(RLIMIT)





BUFSIZE = 8192
class FastIO(io.IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = io.BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(io.IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
    if args:
        sys.stdout.write(str(args[0]))
        split = kwargs.pop("split", " ")
        for arg in args[1:]:
            sys.stdout.write(split)
            sys.stdout.write(str(arg))
    sys.stdout.write(kwargs.pop("end", "\n"))
def debug(*args, **kwargs):
    if DEBUG and not __debug__:
        print("debug", *args, **kwargs)
        sys.stdout.flush()
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip()
inputt = lambda t = 0: range(t) if t else range(int(input()))
inputs = lambda: input().split()
inputi = lambda k = int: map(k, inputs())
inputl = lambda t = 0, k = lambda: list(inputi()): [k() for _ in range(t)] if t else list(k())





def len(a):
    if isinstance(a, range):
        return -((a.start - a.stop) // a.step)
    return builtins.len(a)
def bisect_left(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if key(a[mid]) < x: lo = mid + 1
        else: hi = mid
    return lo
def bisect_right(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if x < key(a[mid]): hi = mid
        else: lo = mid + 1
    return lo
def insort_left(a, x, key = None, lo = 0, hi = None):
    lo = bisect_left(a, x, key, lo, hi)
    a.insert(lo, x)
def insort_right(a, x, key = None, lo = 0, hi = None):
    lo = bisect_right(a, x, key, lo, hi)
    a.insert(lo, x)
do_nothing = lambda x: x
bisect = bisect_right
insort = insort_right
def index(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi and key(a[i]) == x: return a[i]
    if default != None: return default
    raise ValueError
def find_lt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_le(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_gt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError
def find_ge(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError






class Tree:
    def __init__(n):
        self._n = n
        self._conn = [[] for _ in range(n)]
        self._list = [0] * n
    def connect(a, b):
        pass





class Sieve:
    def __init__(self):
        self._n = 6
        self._list = [2, 3, 5, 7, 11, 13]
    def extend(self, n):
        if n <= self._list[-1]: return
        maxbase = int(n ** 0.5) + 1
        self.extend(maxbase)
        begin = self._list[-1] + 1
        newsieve = [i for i in range(begin, n + 1)]
        for p in self.primerange(2, maxbase):
            for i in range(-begin % p, len(newsieve), p):
                newsieve[i] = 0
        self._list.extend([x for x in newsieve if x])
    def extend_to_no(self, i):
        while len(self._list) < i: 
            self.extend(int(self._list[-1] * 1.5))
    def primerange(self, a, b):
        a = max(2, a)
        if a >= b: return
        self.extend(b)
        i = self.search(a)[1]
        maxi = len(self._list) + 1
        while i < maxi:
            p = self._list[i - 1]
            if p < b:
                yield p
                i += 1
            else: return
    def search(self, n):
        if n < 2: raise ValueError
        if n > self._list[-1]: self.extend(n)
        b = bisect(self._list, n)
        if self._list[b - 1] == n: return b, b
        else: return b, b + 1
    def __contains__(self, n):
        if n < 2: raise ValueError
        if not n % 2: return n == 2
        a, b = self.search(n)
        return a == b
    def __getitem__(self, n):
        if isinstance(n, slice):
            self.extend_to_no(n.stop + 1)
            return self._list[n.start: n.stop: n.step]
        else:
            self.extend_to_no(n + 1)
            return self._list[n]
sieve = Sieve()
def isprime(n):
    if n <= sieve._list[-1]:
        return n in sieve
    for i in sieve:
        if not n % i: return False
        if n < i * i: return True
prime = sieve.__getitem__
primerange = lambda a, b = 0: sieve.primerange(a, b) if b else sieve.primerange(2, a)
def factorint(n):
    factors = []
    for i in sieve:
        if n < i * i: break
        while not n % i:
            factors.append(i)
            n //= i
    if n != 1: factors.append(n)
    return factors
factordict = lambda n: Counter(factorint(n))





if __name__ == "__main__":
    main()

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

Solution (Python):
a=input()

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

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

Solution (Python):



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

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

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

Solution (Python):


S = input()


result = ""
if S == "ABC":
    result = "ARC"
elif S == "ARC":
    result = "ABC"


print(result)

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

n = input()

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

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

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

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

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()
r = 'ABC' if s != 'ABC' else 'ARC'
print(r)

Solution (Python):
S = input()
ref = ['ABC', 'ARC']
ref.remove(S)
print(ref[0])

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

Solution (Python):
s = input()

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

Solution (Python):



input = input()


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

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

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

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

Solution (Python):

X=input()

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

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

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

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

Solution (Python):
a = input()

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

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

if 'R' in s:
  print('ABC')
else:
  print('ARC')

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

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

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

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

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

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

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

Solution (Python):
t=input()
if t=='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):

''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 \
   /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/input.txt"
exit $?
'''
import sys


def _s(): return sys.stdin.readline().strip()


def main():
    p = {"ABC", "ARC"} - set((_s(),))
    return p.pop()


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

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

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

Solution (Python):



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

Solution (Python):






"""Module docstring
"""

import functools
import heapq
import itertools
import logging
import math
import random
import string
import sys
from argparse import ArgumentParser
from collections import defaultdict, deque
from copy import deepcopy
from typing import Dict, List, Optional, Set, Tuple


def solve(values: List[int], nb: int) -> int:
    for _v in values:
        pass
    return nb


def do_job():
    "Do the work"
    LOG.debug("Start working")
    
    prev = input()
    print("ABC" if prev == "ARC" else "ARC")


def print_output(testcase: int, result) -> None:
    "Formats and print result"
    if result is None:
        result = "IMPOSSIBLE"
    print("Case 
    
    


def configure_log() -> None:
    "Configure the log output"
    log_formatter = logging.Formatter("%(lineno)d - " "%(message)s")
    handler = logging.StreamHandler(sys.stdout)
    handler.setFormatter(log_formatter)
    LOG.addHandler(handler)


LOG = None

if not LOG:
    LOG = logging.getLogger("template")
    configure_log()


def main(argv=None):
    "Program wrapper."
    if argv is None:
        argv = sys.argv[1:]
    parser = ArgumentParser()
    parser.add_argument(
        "-v",
        "--verbose",
        dest="verbose",
        action="store_true",
        default=False,
        help="run as verbose mode",
    )
    args = parser.parse_args(argv)
    if args.verbose:
        LOG.setLevel(logging.DEBUG)
    do_job()
    return 0


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    sys.exit(main())


class memoized:
    """Decorator that caches a function's return value each time it is called.
    If called later with the same arguments, the cached value is returned, and
    not re-evaluated.
    """

    def __init__(self, func):
        self.func = func
        self.cache = {}

    def __call__(self, *args):
        try:
            return self.cache[args]
        except KeyError:
            value = self.func(*args)
            self.cache[args] = value
            return value
        except TypeError:
            
            
            return self.func(*args)

    def __repr__(self):
        """Return the function's docstring."""
        return self.func.__doc__

    def __get__(self, obj, objtype):
        """Support instance methods."""
        return functools.partial(self.__call__, obj)

Solution (Python):
n=input()

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

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

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

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

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

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

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

Solution (Python):
a= input()
print("ARC" if a[1]=='B' 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()
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):
contest = input()

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

Solution (Python):
a=input()

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

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

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

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

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

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