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



s = str(input())

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
import sys
import itertools
if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
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()).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=="ABC":
    print("ARC")
else:
    print("ABC")

Solution (Python):
import sys
sys.setrecursionlimit(10**6) 
import math 
from copy import copy, deepcopy
from operator import itemgetter

from bisect import bisect_left, bisect, bisect_right

from collections import deque 



from collections import Counter

from itertools import accumulate

from heapq import heapify,heappop,heappush


def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds











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

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

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

Solution (Python):
l = input()
if 'R' in l:
  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 = str(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()
z = ['ARC','ABC']
z.remove(s)
print(z[0])

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

Solution (Python):
S = input()

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

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

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

Solution (Python):
S = input()

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

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

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

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

S = input().rstrip()

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

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

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

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

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

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

A()

Solution (Python):
import math






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

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

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


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


if __name__ == '__main__':
    main()

Solution (Python):
import sys


N = str(input())








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

if __name__ == "__main__":
    main()

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

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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

Solution (Python):
S = input()

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

Solution (Python):
import sys
import math

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

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

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

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

if __name__ == '__main__':
    solve()

Solution (Python):
def main():
    s = input()
    a = {'ABC', 'ARC'}
    a.discard(s)

    print(a.pop())


if __name__ == '__main__':
    main()

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

Solution (Python):
S = input()

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

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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

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

Solution (Python):
import sys
from io import StringIO
import unittest


def resolve():
    s = input()

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

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """ABC"""
        output = """ARC"""
        self.assertIO(input, output)

if __name__ == "__main__":
    
    resolve()

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

if S[1] == 'R':
    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):
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):
s = input()

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

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
inp=input
li=list
iinp=lambda : int(inp())
ent=lambda : map(int,inp().split())
lient=lambda : [int(i) for i in inp().split()]
li0= lambda x: [0 for i in range(x)]
livalor=lambda valor,x: [valor for i in range(x)]
stent=lambda : [i for i in inp()]
filldp=lambda valor,x,y: [[valor for i in range(y)] for i in range(x)]

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

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


if __name__ == '__main__':
    solve()

Solution (Python):
import queue
import copy
import math
from collections import deque
import bisect
from decimal import Decimal


s = input()

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

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

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

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

Solution (Python):


import sys

DEBUG = False

def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep = " "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


def main():
    c = read(str)
    if c == "ABC":
        print("ARC")
    else:
        print("ABC")
    pass


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

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

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

Solution (Python):
def main():
    import sys
    sys.setrecursionlimit(10**6)
    input = sys.stdin.readline
    S = input().strip()
    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):
a = input()
print("ABC" if a == "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=str(input())
if k=='ARC':
    print('ABC')
else:
    print('ARC')

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

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

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

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

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

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

S = str(input())

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

Solution (Python):

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

if __name__ == "__main__":
    resolve()

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

Solution (Python):
import sys
input = sys.stdin.readline
S = input()[: -1]
if S == "ABC": print("ARC")
else: print("ABC")

Solution (Python):




s = input()


if s[1] == 'B':
    ans = 'ARC'
else:
    ans = 'ABC'


print(ans)

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

Solution (Python):
S = input()

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

Solution (Python):
s = input()

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

Solution (Python):


s=input()

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

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

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

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

    print('ARC')


resolve()

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):
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def resolve():
    S = sr()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')
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):
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):
K = input()
if K == 'ABC':
    print('ARC')
else:
    print('ABC')

Solution (Python):

k = input()
if k == "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):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Solution (Python):
S = input()

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

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

i = input()

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

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

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

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


if __name__ == "__main__":
    resolve()

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

Solution (Python):
i = input()

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

Solution (Python):
s = input()
if 'B' in s:
    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):
def main():
    s = input()

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


if __name__ == "__main__":
    main()

Solution (Python):
S=input()

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

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
def resolve():
    '''
    code here
    '''
    S = input()

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

if __name__ == "__main__":
    resolve()

Solution (Python):




def input_int():
    return int(input())



def int1(x):
    return int(x) - 1



def input_to_int_map():
    return map(int, input().split())



def input_to_int_tuple():
    return tuple(map(int, input().split()))



def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    s = input()

    if s == "ABC":
        return "ARC"

    return "ABC"


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

Solution (Python):
import collections
import math
import operator as op
from functools import reduce
from collections import Counter
import numpy as np
import math
import bisect
import heapq


def get_inputs(cast_func=None):
    if cast_func is None:
        return input().split()
    else:
        return list(map(cast_func, input().split()))


def get_input(cast_func=None):
    if cast_func is None:
        return input()
    else:
        return cast_func(input())


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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
s = input()

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

Solution (Python):

from collections import deque
from operator import itemgetter
from bisect import bisect_left, bisect
import itertools
import sys
import math
import numpy as np
import time
sys.setrecursionlimit(10**6)



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


if __name__ == '__main__':
    main()

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

if N == "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):
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def S(): return sys.stdin.readline().rstrip()
def LS(): return sys.stdin.readline().split()
def LS2(N): return [sys.stdin.readline().split() for i in range(N)]
def FILL(i,h): return [i for j in range(h)]
def FILL2(i,h,w): return [FILL(i,w) for j in range(h)]
def FILL3(i,h,w,d): return [FILL2(i,w,d) for j in range(h)]
def FILL4(i,h,w,d,d2): return [FILL3(i,w,d,d2) for j in range(h)]
def sisha(num,digit): return Decimal(str(num)).quantize(Decimal(digit),rounding=ROUND_HALF_UP)

MOD = 1000000007
INF = float("inf")
sys.setrecursionlimit(10**5+10)


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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
  main()

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

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

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

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):
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):
pi = 3.1415926


def inp():
    return(int(input().rstrip()))
def inlt():
    return(list(map(int,input().rstrip().split())))
def insr():
    s = input().rstrip()
    return(s[:len(s) - 1])
def invr():
    return(map(int,input().rstrip().split()))

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

Solution (Python):


def input_one_number():
    return int(input())

def input_multiple_number():
    return map(int, input().split())

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

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
import math
import string
import collections
from collections import Counter
from collections import deque
import sys
sys.setrecursionlimit(2*10**5)
INF = 2**60


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

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

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

Solution (Python):
def solve(a):
    if a == 'ABC':
        return 'ARC'
    else:
        return 'ABC'

if __name__ == "__main__":
    a = input()
    print(solve(a))

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

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

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