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.



Sample input:
ABC


Sample output:
ARC

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
from math import gcd

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
contest = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
I = input()

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = "ABC"
b = "ARC"
S = input()

if S == a:
    print(b)
else:
    print(a)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

S = input().strip()
#-----

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
import pprint

sys.setrecursionlimit(10 ** 6)

class Logger:
	def __init__(self, debug):
		self.debug = debug
	def print(self, *args):
		if self.debug:
			pprint.pprint(args)


def main():
	log = Logger(1)
	s = sys.stdin.readline().rstrip()
	if s == "ABC":
		print("ARC")
	else:
		print("ABC")
	


main()

Submission status: Accepted

Solution code:
val = input()
if val=="ABC":
  print("ARC")
elif val=="ARC":
  print("ABC")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print('AARBCC'[input()>'AC'::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

    S = input()

    if S == 'ABC':
        print('{}'.format('ARC'))
    else:
        print('{}'.format('ABC'))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

import math
input = sys.stdin.readline

hoge = str(input().strip())
if hoge == "ABC":
   print("ARC".strip())
if hoge == "ARC":
       print("ABC".strip())

Submission status: Accepted

Solution code:
data = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import numpy as np
# from itertools import permutations
# from itertools import combinations
# from itertools import combinations_with_replacement
# import queue
# import heapq


def main():
    # N, M = map(int, input().split())
    # As = list(map(int, input().split()))

    S = input()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
str = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

S = input()

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

Submission status: Accepted

Solution code:
# coding: utf-8

S = input()
arc = "ARC"
abc = "ABC"
if S == arc:
    print(abc)
elif S == abc:
    print(arc)

Submission status: Accepted

Solution code:
word = input()

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

Submission status: Accepted

Solution code:
data = input()

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = str(input())
if a=="ARC":
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            a,b,c=(inp+[1])[:3]
            org_inp.append(inp)
        else:
            index=0
            a,b,c=(ls[i]+[1])[:3]
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0}) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)];rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()

class Comb:
    def __init__(self,n,mo=10**9+7):
        self.fac=[0]*(n+1)
        self.inv=[1]*(n+1)
        self.fac[0]=1
        self.fact(n)
        for i in range(1,n+1):
            self.fac[i]=i*self.fac[i-1]%mo
            self.inv[n]*=i
            self.inv[n]%=mo
        self.inv[n]=pow(self.inv[n],mo-2,mo)
        for i in range(1,n):
            self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
        return
    
    def fact(self,n):
        return self.fac[n]
        
    def invf(self,n):
        return self.inv[n]

    def comb(self,x,y):
        if y<0 or y>x:
            return 0
        return self.fac[x]*self.inv[x-y]*self.inv[y]%mo

class Tree:
    def __init__(self,inp_size=None,init=True):
        if init:
            self.stdin(inp_size)
        return

    def stdin(self,inp_size=None):
        if inp_size==None:
            self.size=int(input())
        else:
            self.size=inp_size
        self.edges,_=GI(self.size,self.size-1)
        return
    
    def listin(self,ls):
        self.size=len(ls)+1
        self.edges,_=GI(self.size,self.size-1,ls)
        return

    def __str__(self):
        return  str(self.edges)

    def dfs(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
        q=deque()
        q.append(x)
        v=[-1]*self.size
        v[x]=root_v
        while q:
            c=q.pop()
            for nb,d in self.edges[c]:
                if v[nb]==-1:
                    q.append(nb)
                    v[nb]=func(v[c],nb,d)
        return v

    def EulerTour(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
        q=deque()
        q.append((-1,x))
        v=[None]*self.size
        v[x]=root_v
        et=[]
        while q:
            cb,ce=q.pop()
            et.append(ce)
            for nb,d in self.edges[ce]:
                if v[nb]==None:
                    q.append((nb,ce))
                    q.append((ce,nb))
                    v[nb]=func(v[ce],nb,d)
        vid=[[-1,-1]for i in range(self.size)]
        for i,j in enumerate(et):
            if vid[j][0]==-1:
                vid[j][0]=i
            else:
                vid[j][1]=i
        return v,et,vid
    
    def LCA_init(self,depth,et):
        self.st=SegTree(self.size*2-1,func=min,ide=inf)
        for i,j in enumerate(et):
            self.st.update(i,j)
        self.LCA_init_stat==True
        return
    
    def LCA(self,root,x,y):
        if self.LCA_init_stat==False:
            depth,et,vid=self.EulerTour(root)
            self.LCA_init(depth,et)
        return self.st.query(x,y+1)

show_flg=False
show_flg=True


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if s == 'ABC':
    ans = 'ARC'
else:
    ans = 'ABC'

print(ans)

Submission status: Accepted

Solution code:
s=input()

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

else:
    print("ARC")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("A"+"BR"[input()<"ARC"]+"C")

Submission status: Accepted

Solution code:
import sys

if __name__ == "__main__":
    line1 = sys.stdin.readline().strip()

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力
A=str(input())
result=""

# 処理
if A=="ABC":
    result="ARC"
else:
    result="ABC"

print(result)

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
multi = str(input())
if multi == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun May  3 21:35:36 2020

@author: nanasakiwataru
"""

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

Submission status: Accepted

Solution code:
s = input()

abc = 'ABC'
arc = 'ARC'

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S = read().rstrip().decode()
x = ['ABC', 'ARC']
x.remove(S)
print(x[0])

Submission status: Accepted

Solution code:
taikai = input()
if taikai == 'ARC':
    print('ABC')
elif taikai == 'ABC':
    print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
if s[1] == 'B':
  print('ARC')
elif s[1] == 'R':
  print('ABC')

Submission status: Accepted

Solution code:
str = input()
if str == 'ABC':
    print('ARC')
elif str == 'ARC':
    print('ABC')

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=str(input())
if s=='ABC':
  print('ARC')
  
elif s=='ARC':
  print('ABC')
  
else:
  pass

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
contest_1 = "ABC"
contest_2 = "ARC"

S = input()

if S == contest_1:
    print(contest_2)
else:
    print(contest_1)

Submission status: Accepted

Solution code:
# coding: utf-8

############################

s=str(input())

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
a, b, c = input()
if b=='R':
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if __name__ == '__main__':
    start()

Submission status: Accepted

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


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()
def kaisai(x):
	if str == "ABC":
  		kaisai = "ARC"
	elif str == "ARC":
  		kaisai = "ABC"
	return kaisai
print(kaisai(str))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp_s = input()
out_s = "ARC" if inp_s == "ABC" else "ABC"
print(out_s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
if s == 'ABC':
    print('ARC')
elif s == 'ARC':
    print('ABC')

Submission status: Accepted

Solution code:
bun = input()
if bun == 'ABC':
  print('ARC')
elif bun == 'ARC':
  print('ABC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
if input() == "ABC":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:

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

else:
    print("ABC")

Submission status: Accepted

Solution code:
# A - A?C
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S =input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import os

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input().strip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 初期入力
import sys
#input = sys.stdin.readline
S = input().strip()

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

Submission status: Accepted

Solution code:

s=input()

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

Submission status: Accepted

Solution code:
s = input()
ret = "ABC"
if s == "ABC":
    ret = "ARC"

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
S = raw_input()

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

Submission status: Accepted

Solution code:
s = input()

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

else:
  print("ABC")

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


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


    #print('\33[32m' + 'end' + '\033[0m') # debug

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str=input()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


s = raw_input()
print d[s]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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