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):
import numpy as np 
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):
import sys
input = sys.stdin.readline

def main():
    s = input().rstrip()

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

Solution (Python):
s = input()

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

Solution (Python):
s = input()

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

Solution (Python):
S = input()

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

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

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

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

Solution (Python):















mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

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

def main():
    s = input()
    if s[1]=='B':
        print("ARC")
    else:
        print("ABC")
    return

if __name__=='__main__':
    main()

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

def main():
    S = read().strip().decode()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')
    return

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


s = input()
task(s)

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

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

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

Solution (Python):
s = input()

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

Solution (Python):


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

main()

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

Solution (Python):
from sys import stdin, setrecursionlimit

setrecursionlimit(10 ** 9)


def input():
    return stdin.readline().strip()


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

Solution (Python):

import sys


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

if s=="ARC":

    print("ABC")

else:
    print("ARC")

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

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

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

Solution (Python):
def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

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

    else:
        print('ABC')
        
resolve()

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

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

Solution (Python):
import sys
from math import log2,floor,ceil,sqrt



Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
 
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')
INF = 10 ** 18
MOD = 10**9+7

st  = ri()
if st == "ABC":
    print("ARC")
else:
    print("ABC")

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

Solution (Python):
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

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

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

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

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

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

Solution (Python):
import sys

s = sys.stdin.readline().rstrip()
def main():
    print('ABC' if s == 'ARC' else 'ARC')

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

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 sys
input = sys.stdin.readline



'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''

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

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

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


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

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

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

Solution (Python):

import sys

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() 


def main():
    s = ns()
    if s == 'ABC':
        print('ARC')
    else:
        print('ABC')
    return


if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    S = input()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')


main()

Solution (Python):
x = str(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):
print("AABRCC"[input()=="ABC"::2])

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

Solution (Python):
S = input()

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

Solution (Python):

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

if __name__ == "__main__":
    resolve()

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

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


def main():
    s = input().rstrip()
    print(['ABC', 'ARC'][s == "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):
if input()=="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):
def main():

    from bisect import bisect_left as bl, bisect_right as br, insort
    import sys,heapq,math
    from collections import defaultdict as dd, deque
    def data(): return sys.stdin.readline().strip()
    def mdata(): return list(map(int, data().split()))
    out = sys.stdout.write
    
    INF = int(1e9)
    mod = int(1e9)+7

    s=data()
    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 math
from collections import Counter
x=input()
if x=='ABC':
	print('ARC')
else:
	print('ABC')

Solution (Python):
import sys

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 == '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


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


sys.setrecursionlimit(20000000)


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


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 math

if __name__ == '__main__':
    

    
    

    

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


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

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

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

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

Solution (Python):
s = input()

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

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

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

Solution (Python):
s = input()

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

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

Solution (Python):


def main():
    
    S =input()

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

    return

if __name__ == "__main__":
    main()

Solution (Python):
a = input()

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

Solution (Python):
mod = 10**9+7
import sys
from collections import Counter, defaultdict, deque
from itertools import product, permutations, combinations, combinations_with_replacement
from itertools import accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil,floor
from copy import deepcopy
from heapq import heappop,heappush,heapify
import heapq







sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1


p2D = lambda x: print(*x, sep="\n")

def II(): return int(sys.stdin.readline())

def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())




def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI(): return list(map(lambda x:int(x), sys.stdin.readline().split()))
def HI(): return list(map(lambda x:int(x)*(-1), sys.stdin.readline().split()))




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

import sys


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



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


if __name__ == '__main__':
    main()

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

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

Solution (Python):

import sys


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



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

if __name__ == '__main__':
    main()

Solution (Python):
s = input()

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

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

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

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

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

Solution (Python):

import sys


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

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

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

Solution (Python):
s=input()

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s=input()
    if s=="ABC":print("ARC")
    else:print("ABC")

if __name__=='__main__':
    main()

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

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

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

Solution (Python):
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi

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

S = input()

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

Solution (Python):
s=input()

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

Solution (Python):
S=input()

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

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

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

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

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

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

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

Solution (Python):
def main():
    if input() == "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=="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()
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 "ARC")

Solution (Python):
import sys
import os

def file_input():
    f = open('../Beginner_Contest_/input.txt', 'r')
    sys.stdin = f

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):
from sys import stdin

def main():

    input = stdin.readline

    S = input()[:-1]

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

Solution (Python):

S = input()

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

Solution (Python):
S = input()

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

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

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

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

Solution (Python):



import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)

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

if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [[input().split()] for _ in range(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

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

Solution (Python):

s = input()

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

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

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

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

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):
Ss = input().rstrip()

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

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

s = input().strip()

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

Solution (Python):
s = input()

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

Solution (Python):
s = input()

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

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

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

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

abc166_a()

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

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
import sys
import itertools
import heapq
import numpy as np
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

Solution (Python):
A = input()

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

Solution (Python):

"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""


"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""



"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""


"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  
def LS(): return list(input())  
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

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

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

Solution (Python):
def main():
    s = input()

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

    print('ABC')


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import itertools
import math
import numpy as np
import fractions
from collections import deque
from itertools import combinations
from functools import reduce
from functools import lru_cache
import bisect
import sys
import math
sys.setrecursionlimit(10**9)

def main():
    x = input()
    abc = "ABC"
    arc = "ARC"

    print(abc if x == arc else arc)

if __name__ == "__main__":
  main()

Solution (Python):

S = str(input())

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