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

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

Submission status: Accepted

Solution code:
n = list(str(input()))
if n[1]=="B":
    n[1]="R"
else:
    n[1]="B"
print("".join(n))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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 *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

##### 割り算の切り上げ #####
# tmp = -(-4 // 3)

##### dict の for文 #####
# for k, v in d.items():
#     print(k, v)

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





#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
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

# mを法とするaの乗法的逆元
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

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    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))  # 10
    """
    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):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        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):
        # 0からnまでのmod逆元のリストを返す O(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

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# dfs のサンプル
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__=='__main__':
  c = input()
  if c=='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:
S = input()
if S == 'ABC':
    print('ARC')
elif S == 'ARC':
    print('ABC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = input()
if b=="B":
	print("ARC")
if b=="R":
	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\n")
else :
    print("ABC\n")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/env python3 

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:
st = str(input())
if (st=="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:
d = input()
if d == '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:
N = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a =['ABC']
S=input()
if S in a:
  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:
inp = input()
out = ''

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
if s[1]=="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().strip()
if s[1] == "R":
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# n, m, q = map(int, input().split())
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:
A=input()
if A==("ABC"):
    print("ARC")
if A==("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:
a = input()
if a == 'ARC':
    print('ABC')
else:
    print('ARC')

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()#ABC or ARC

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


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

Submission status: Accepted

Solution code:
#!python3

# input
S = input()


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
input_str = input()

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

Submission status: Accepted

Solution code:
import sys
import numpy as np

s=sys.stdin.readline().strip()
#n,k=map(int,sys.stdin.readline().split())
#a=np.array(sys.stdin.readline().split(),dtype='int64')
#a=np.array([sys.stdin.readline().split() for i in range(n)],dtype='int64')

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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 = str(input())

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
cont = input()
if cont == '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 = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()
if N=='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:
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")

Submission status: Accepted

Solution code:
if "B" in raw_input():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:
# -*- coding:utf-8 -*-

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = (input())
if n == '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:



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

Submission status: Accepted

Solution code:
#--A - A?C

S = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

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


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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:
def Main(S):
    d = {"ABC":"ARC", "ARC":"ABC"}
    return d[S]

def main():
    S = str(input())
    print(Main(S))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=str(input())
a=list(s)
if a[1]=="B":
    print(s.replace('B', 'R'))
else:
    print(s.replace('R', 'B'))

Submission status: Accepted

Solution code:
k = input()
print(['ABC','ARC'][k=='ABC'])

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

if "R" in S:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()

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

Submission status: Accepted

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

#   int(input())
#   input().split()
#   map(int, input().split())

s = input().strip()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
  s = input()

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


main()

Submission status: Accepted

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


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
import math
from sys import stdin,stdout
#% 998244353
T = stdin.readline()
T=T[:-1]
if T=="ABC":
    print("ARC")
elif T=="ARC":
    print("ABC")

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
print('ABC' if s[1] == 'R' else '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" or S == "ARC":
  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:
x = input()
if x == "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")
elif s=='ARC':
    print("ABC")
else:
    pass

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline    ####
int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

INF = float('inf')

def solve():
    s = input()
    if s == 'ABC':
        print('ARC')
    elif s == 'ARC':
        print('ABC')


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, N, C = map(str, input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
comp = input()
try :
  if comp[1] == 'R' :
    print("ABC")
  else : print("ARC")
except: 
  pass

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_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 = 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()
ans = ""
if a == "ABC":
    ans = "ARC"
else:
    ans = "ABC"

print(ans)