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

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

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

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

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

Solution (Python):

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

Solution (Python):
s = input()

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

Solution (Python):

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

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

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

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

Solution (Python):
def d():
    s = input()
    count = 0
    for i in range(1, 60):
        ans = 2019 * i
        if '0' not in str(ans):
            count += 1
            print(i, ans)

    print(count)

def c():
    n = int(input())
    s = ['']*n
    for i in range(n):
        s[i] = input()
    s.sort()
    count = 1
    for i in range(1, n):
        if s[i - 1] != s[i]:
            count += 1
    print(count)

def b():
    a,b,c,d = map(int, input().split())
    while True:
        c -= b
        if c <= 0:
            print('Yes')
            break
        a -= d
        if a <= 0:
            print('No')
            break

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



a()

Solution (Python):
S =input()

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

Solution (Python):

import sys
import os

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

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

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

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):
line = input().strip()

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

Solution (Python):
S = input()
if(S[1]=="B"):
    result = S.replace("B","R")
else:
    result = S.replace("R","B")
print(result)

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

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

Solution (Python):

import sys

S = input().strip()

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

print("{}".format(ret))

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

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

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

Solution (Python):
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]
def init_dp1(init, N): return [init for _ in range(N)]
def init_dp2(init, N, M): return [[init for _ in range(M)] for _ in range(N)]


class V:
    def __init__(self, f, v=None):
        self.f = f
        self.v = v
 
    def __str__(self):
        return str(self.v)
 
    def ud(self, n):
        if n is None:
            return

        if self.v is None:
            self.v = n
            return
        self.v = self.f(self.v, n) 


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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
S = input()
def check():
    if S=='ABC':
        return 'ARC'
    return 'ABC'
print(check())

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

Solution (Python):
S=input()

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

Solution (Python):
S = input()

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

Solution (Python):
S = raw_input()

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

Solution (Python):
s = input()

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

else:
  print("ABC")

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

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

Solution (Python):
s = input()

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

Solution (Python):




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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy


from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd

sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

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

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

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

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

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

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

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

Solution (Python):
str=input()

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

Solution (Python):

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

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

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

Solution (Python):
s=input()
print("A"+chr(ord("B")+ord("R")-ord(s[1]))+"C")

Solution (Python):
S = input()

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

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

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

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

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

Solution (Python):
from collections import deque
import sys
input = sys.stdin.readline().strip('\n')
if input=='ABC':
    print('ARC')
elif input=='ARC':
    print('ABC')
else:
    print(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):
str=input()
if str=='ABC':
    print('ARC')
else:
    print('ABC')

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

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

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

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

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

Solution (Python):
d = {
        'ABC': 'ARC',
        'ARC': 'ABC'
    }


s = raw_input()
print d[s]

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


s  = S()
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):
n = list(str(input()))
if n[1]=="B":
    n[1]="R"
else:
    n[1]="B"
print("".join(n))

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

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

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *
































def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007




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









def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res


def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y



def H(n, r, mod=10**9+7):
	
	
    return combination(n+r-1, r, mod)


class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        
        
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv



def dfs(graph,parent,counter,edge):
    stk = []
    stk.append(edge)
    while len(stk) > 0:
        p = stk.pop()
        for e in graph[p]:
            if parent[p] == e:
                continue
            else:
                parent[e] = p
                counter[e] += counter[p]
                stk.append(e)

if __name__ == "__main__":
	main()

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

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

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

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

Solution (Python):
S = input().strip()

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

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

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

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

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
S = input()

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

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

Solution (Python):
S = input()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a =['ABC']
S=input()
if S in a:
  print("ARC")
else:
    print("ABC")

Solution (Python):
s= input()

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

Solution (Python):
inp = input()
out = ''

if inp == 'ABC' :
    out = 'ARC'
    
if inp == 'ARC' :
   out = 'ABC'
  
print(out)

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

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

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

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

Solution (Python):
import sys
from random import choice,randint
inp=sys.stdin.readline
out=sys.stdout.write
flsh=sys.stdout.flush
 
sys.setrecursionlimit(10**9)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
 
def MI(): return map(int, inp().strip().split())
def LI(): return list(map(int, inp().strip().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]
def LI_(): return [int(x)-1 for x in inp().strip().split()]
def LF(): return [float(x) for x in inp().strip().split()]
def LS(): return inp().strip().split()
def I(): return int(inp().strip())
def F(): return float(inp().strip())
def S(): return inp().strip()
def pf(s): return out(s+'\n')
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)

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

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

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

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

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

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

Solution (Python):
S = input()

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

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

Solution (Python):


import sys






















def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    print('ARC') if s == 'ABC' else print('ABC')


if __name__ == "__main__":
    main()

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

Solution (Python):


def main():
    S = input()
    if S == 'ABC':
        out = 'ARC'
    else:
        out = 'ABC'
    print(out)
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):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

from collections import defaultdict
from sys import exit
import math


def main():
    s = input().strip()
    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):
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):
s = input()
a = 'ABC'
if s == a:
    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):


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    S=input()
    if S=="ABC":
        print("ARC")
    else:
        print("ABC")

main()

Solution (Python):



S = input()


def main():
    d = {"ABC": "ARC", "ARC": "ABC"}
    ans = d[S]
    print(ans)


if __name__ == "__main__":
    main()

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

if input_str[-2] == 'B':
    print('ARC')
else:
    print('ABC')

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

Solution (Python):
import sys
import numpy as np

s=sys.stdin.readline().strip()




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

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

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

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

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

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

Solution (Python):
string = input().strip()

if string == "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 'ARC')

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

Solution (Python):
s = input()

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

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

Solution (Python):
s=input()

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

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

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

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

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

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

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

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

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

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

if s == b:
    print(r)
else :
    print(b)

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

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
    if(a%b==0):return(b)
    return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
S=input()
if S=="ABC":
    print("ARC")
else:
    print("ABC")

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