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

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

Submission status: Accepted

Solution code:
#ABC166-A
X = input()
print(X == "ABC" and "ARC" or "ABC")

Submission status: Accepted

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

Submission status: Accepted

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

last_week_contest = input()

print(contenst_table[last_week_contest])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
dict_contest = {'ABC':'ARC', 'ARC':'ABC'}
print(dict_contest.get(s))

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    cands = {'ABC', 'ARC'}

    S = input()
    cands.discard(S)

    print(cands.pop())


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
cur_and_next_contests = {"ABC": "ARC", "ARC": "ABC"}
print(cur_and_next_contests[input()])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N=input().rstrip()
if N == "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 = str(input())
if s == 'ABC':
  print('ARC')
else:
  print('ABC')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(input() == "ABC" and "ARC" or "ABC")

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

Submission status: Accepted

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

def main():

    S = input()

    if S == 'ABC':
        ans = 'ARC'
    
    else:
        ans = 'ABC'

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# abc166_a.py
# https://atcoder.jp/contests/abc166/tasks/abc166_a

# A - A?C /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# AtCoder 社は、毎週土曜日にコンテストを開催しています。
# コンテストには ABC と ARC の 2つの種類があり、毎週どちらか一方が開催されます。
# ABC が開催された次の週には ARC が開催され、ARC が行われた次の週には ABC が開催されます。
# 先週開催されたコンテストを表す文字列 Sが与えられるので、今週開催されるコンテストを表す文字列を出力してください。

# 制約
#     Sは ABC または ARC

# 入力
# 入力は以下の形式で標準入力から与えられる。
# S

# 出力
# 今週開催されるコンテストを表す文字列を出力せよ。

# 入力例 1
# ABC

# 出力例 1
# ARC

# 先週開催されたコンテストは ABC なので、今週は ARC が開催されます。


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[0]
    # N = int(lines[0])
    # N, M = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    result = 'ABC'
    if S == 'ABC':
        result = 'ARC'

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['ABC']
        lines_export = ['ARC']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
s = input()
#a, b = map(int, input().split())
#l = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
S = input()

ans = {
    'ABC': 'ARC',
    'ARC': 'ABC'    
}

print(ans[S])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

S = input()

if not ( S == 'ABC' or S == 'ARC' ): sys.exit()

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

Submission status: Accepted

Solution code:
def main():
  M=input()
  if M == '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:
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")
else:
	print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
print("AABRCC"[s=="ABC"::2])

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

if s=="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:
s = {'ABC': 'ARC', 'ARC': 'ABC'}
print(s[input()])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import time

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

if __name__ == '__main__':
    #start = time.time()
    print(main())
    #elapsed_time = time.time() - start
    #print("経過時間:{}".format(elapsed_time * 1000) + "[msec]")

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/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:
s = input()

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 = readline().decode().rstrip()
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:
word = input()

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

Submission status: Accepted

Solution code:
s = {input()}
test = {'ABC', 'ARC'}
print(list(test - s)[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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


def main():
    solve()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import numpy as np
#import math
#from decimal import *
#from numba import njit

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

main()

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:
def main():
    arg = input().rstrip()
    ans = 'ABC' if arg == 'ARC' else 'ARC'

    print(ans)


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

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':
    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:
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:
i = input()
if (i == "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:
ct = input()

if ct == '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:
print(input()[1] == "B" and "ARC" or "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:
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:
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 = 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:
a = str(input())
if a=="ABC":
    print("ARC")
elif a=="ARC":
    print("ABC")

Submission status: Accepted

Solution code:
X = input()

if (X == 'ABC'):
  print("ARC")
elif (X == 'ARC'):
  print("ABC")
else:
  print("NONE")

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

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

s[1] = (s[1] == 'B') and 'R' or 'B'

a = ''.join(s)
print(a)

Submission status: Accepted

Solution code:
s = raw_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:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def c166(x):
    if x == "ABC": return "ARC"
    if x == "ARC": return "ABC" 



if __name__=="__main__":
    input1 = input()
    print(c166(input1))

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
def main():
    print(list(set(["ABC", "ARC"])-{input()})[0])
        

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if N[1] == "R":
  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:
def resolve():
    S = str(input())
    if S =='ABC':
        print('ARC')
    else:
        print('ABC')
    return

resolve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
ss=[0, "ABC", "ARC"]

if s==ss[1]:
    print(ss[-1])
else:
    print(ss[1])

Submission status: Accepted

Solution code:
a = list(input())
if a[1] == "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:
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 == 'ARC':
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
print {'ABC':'ARC', 'ARC': 'ABC'}[raw_input()]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def a_c(f):
    s = f.read().decode().strip()
    return 'ABC' if s == 'ARC' else 'ARC'


def main():
    ans = a_c(sys.stdin.buffer)
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def readinput():
    s=input()
    return s

def main(s):
    if s=='ABC':
        return 'ARC'
    elif s=='ARC':
        return 'ABC'
    ans=''
    return ans

if __name__=='__main__':
    s=readinput()
    ans=main(s)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return 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)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np    # cumsum
# from bisect import bisect_left, bisect_right

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

Submission status: Accepted

Solution code:
print('AABRCC'[input()=='ABC'::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(f'A{["B","R"]["B"==input()[1]]}C')

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
import sys
S = input()

if S == "ABC":
    print("ARC")
    sys.exit()
else:
    print("ABC")
    sys.exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#166A
#A?C

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:
import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline


#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()

#import numpy as np

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










if __name__ == "__main__":
	main()

Submission status: Accepted

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

    s = readline().rstrip().decode()
    check = {'ABC': 'ARC', 'ARC': 'ABC'}
    print(check[s])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
data = stdin.readline().strip()

a = data.split()[0]

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
x = input()
if x=="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:
from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

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

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


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






mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
contests = ['ABC', 'ARC']
before_contest = input()
print(contests[0] if before_contest == contests[1] else contests[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
s = input()
if s == 'ABC':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

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