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

Solution (Python):
S=input()

if S[1] == "B":
    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):
N = input()

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

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

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

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

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

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

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

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

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

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

Solution (Python):
S=raw_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().split()
if(S[0] == "ABC"):
    print("ARC")
else:
    print("ABC")

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

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

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

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

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

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

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

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

ans = ''

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

ans = 'ARC'

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

Solution (Python):
S=input()

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians

from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    S = INPUT()
    print("ARC" if S == "ABC" else "ABC")


if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin
n = stdin.readline().rstrip()
if n == '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):
S = input()



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

Solution (Python):
S = input()

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

Solution (Python):

import sys


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

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

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

Solution (Python):
a=input()

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

Solution (Python):
import os

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

Solution (Python):
S = input()

if S == 'ABC':
    print('ARC')
elif 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):
print('ARC' if 'B' in input() else 'ABC')

Solution (Python):

"""
Created on Sun May  3 20:56:26 2020
"""

import sys


sys.setrecursionlimit(10 ** 9)


mod = 10**9+7

S = input()

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

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

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

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

Solution (Python):
def calc(S):
    if S == 'ABC':
        return 'ARC'
    else:
        return 'ABC'


S = input()
print(calc(S))

Solution (Python):
last = input()
if last == "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):
def main():
    
    S = str(input())
    if S == "ABC" :
        print("ARC")
    elif S == "ARC" :
        print("ABC")


if __name__ == '__main__':
    main()

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

Solution (Python):

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

solution()

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools










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=='ARC':
  print('ABC')
else:
  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):
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()
print('ABC') if s == 'ARC' else print('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):
if input() == '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
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

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

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp



class UnionFindEx:
    def __init__(self, size):
        
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


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

main()

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

Solution (Python):
import sys

def main():
    S = input()

    if S == 'ABC':
        ans = 'ARC'
    else:
        ans = 'ABC'

    print(ans)
    return

if __name__ == '__main__':
    main()
    sys.exit(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):
s = input()
if s[1] is 'B':
    print('ARC')
else:
    print('ABC')

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

Solution (Python):
S=input()
print(S[0]+("R" if S[1]=="B" else "B")+S[2])

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

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

Solution (Python):
def resolve():
    
    n = input()
    
    
    
    
    
    
    
    

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

 

resolve()

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

Solution (Python):
def main():
    s = input()
    ans = solve(s)
    print(ans)


def solve(s):
    ans = 'ABC' if s == 'ARC' else 'ARC'
    return ans


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

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

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

Solution (Python):
S = input()

d = {'ABC': 'ARC', 'ARC': 'ABC'}

print(d[S])

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

Solution (Python):

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

Solution (Python):
s=input()
print('ABC' if s=='ARC' 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):
'''
.append(要素) リストに要素を追加
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
from functools import reduce
from operator import mul
from collections import Counter
import itertools
import fractions

t = stdin.readline().rstrip()
if t == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):
S = input()

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

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


if __name__ == '__main__':
    resolve()

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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):


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

Solution (Python):
a = input()

if a == '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):
s = input()

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

Solution (Python):
S = input()


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

Solution (Python):
import sys,math,copy,queue,itertools,bisect,collections
from heapq import *
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(-1,0),(0,1),(0,-1))

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

Solution (Python):
S =str(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):
K = input()

if K == '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):
s = input()

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

Solution (Python):
s = input()



ans = ''

if s == 'ABC':
    ans = 'ARC'
else:
    ans = 'ABC'

print(ans)

Solution (Python):

import sys
input = sys.stdin.readline

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

Solution (Python):
k = input()

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

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

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

Solution (Python):
def examA():
    S = SI()
    if S=="ARC":
        ans = "ABC"
    else:
        ans = "ARC"
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(readline())
def LI(): return list(map(int,readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

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 == '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):
import numpy as np
import math
import scipy as sp
import queue
import collections

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

def main(kwargs):
    s = kwargs["s"]

    if s == 'ABC':
        res = 'ARC'
    else:
        res = 'ABC'

    return res

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    kwargs["s"] = cin[0]
    
    
    

    cout = main(kwargs)
    print(cout)

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

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):
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):
import itertools
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()

ans = "ABC"

if a == "ABC":
    ans = "ARC"

print(ans)

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

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

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

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

Solution (Python):
N=input()

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

else:
    print("ABC")

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

Solution (Python):
from sys import stdin
S = (stdin.readline().rstrip())
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()

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

Solution (Python):

import sys


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



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    print(solve(S))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    
    main()

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

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

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
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()


'''

'''
'''
n = input()
a = [int(input()) for i in range(n)]
'''
'''
n,m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(m)]
'''
 

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

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

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