AtCoder Beginner Contest 166 - A?C

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-----
ABC

-----Sample Output-----
ARC

They held an ABC last week, so they will hold an ARC this week.

Source: atcoder | Difficulty: EASY


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


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


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


print({'ABC': 'ARC', 'ARC': 'ABC'}[input()])


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


s = input()
print('A' + chr(ord('B') + ord('R') - ord(s[1])) + 'C')


print('A%sC' % 'BR'[input() < 'AR'])


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


print('A' + {'B': 'R', 'R': 'B'}[input()[1]] + 'C')


def main() -> None:
	s = input()
	print('ARC' if s == 'ABC' else 'ABC')
	return

def __starting_point():
	main()
__starting_point()


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


print('A' + 'BR'[input() == 'ABC'] + 'C')


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


print(f"A{['B', 'R'][input() == 'ABC']}C")


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


print(['ABC', 'ARC'][str(input()) == 'ABC'])


C = input()[1]
print('ABC' if C == 'R' else 'ARC')


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


print('ABCARC'.replace(input(), ''))


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


print(input()[1] == 'B' and 'ARC' or 'ABC')


d = ['ABC', 'ARC']
s = input()
print(d[1 - d.index(s)])


list = {'ABC': 'ARC', 'ARC': 'ABC'}
a = input()
print(list[a])


k = {'ABC': 'ARC', 'ARC': 'ABC'}
print(k[input()])


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


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


print(['ARC', 'ABC']['R' in input()])


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


if 'B' in input():
	print('ARC')
else:
	print('ABC')


print(f"{('ABC' if input() == 'ARC' else 'ARC')}")


s = input()
d = {'ABC': 'ARC', 'ARC': 'ABC'}
print(d[s])


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


(a, b) = ('ABC', 'ARC')
print({a: b, b: a}[input()])


print('A' + ('B' if input() == 'ARC' else 'R') + 'C')


import sys
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
GOSA = 1.0 / 10 ** 10
MOD = 10 ** 9 + 7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z') + 1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

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

def F():
	return float(sys.stdin.readline())

def DP(N, M, first):
	return [[first] * M for n in range(N)]

def DP3(N, M, L, first):
	return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe

def solve():
	s = input()
	if s == 'ABC':
		print('ARC')
	else:
		print('ABC')
	return 0

def __starting_point():
	solve()
__starting_point()


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


print('A' + 'BR'[input() < 'ARC'] + 'C')


print(input().translate(str.maketrans({'R': 'B', 'B': 'R'})))


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


print('AABRCC'[input()[1] != 'R'::2])


o = {'ABC': 'ARC', 'ARC': 'ABC'}
s = input()
print(o[s])


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


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


a = input()
print(a[0] + ('B' if a[1] == 'R' else 'R') + a[2])


print('AABRCC'['B' in input()::2])


print('AARBCC'[input() != 'ABC'::2])


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


nx = {'ABC': 'ARC', 'ARC': 'ABC'}
print(nx[input()])


S = ['ABC', 'ARC']
print(S[S.index(input()) - 1])


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


print('A%sC' % 'BR'[id(id) % 9 % 2])


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


X = input()
print(X == 'ABC' and 'ARC' or 'ABC')


s = input()
out = ('ABC', 'ARC')[s == 'ABC']
print(out)


a = input().rstrip()
y = 'ABC'
if a == y:
	y = 'ARC'
print(y)


print('AABRCC'[input()[1] == 'B'::2])


print('A' + 'RB'[input()[1] == 'R'] + 'C')


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


next = {'ABC': 'ARC', 'ARC': 'ABC'}
print(next[input()])


s = input()
print('A' + ('B' if s[1] == 'R' else 'R') + 'C')


S = input()
d = {'ABC': 'ARC', 'ARC': 'ABC'}
print(d[S])


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


s = input()
z = ['ARC', 'ABC']
z.remove(s)
print(z[0])


s = input()
if s.find('B') == 1:
	print('ARC')
else:
	print('ABC')


ans = {'ABC': 'ARC', 'ARC': 'ABC'}
print(ans[input()])


a = input()
if a == 'S':
	print('今週開催されるコンテストを表す文字列を出力せよ。')
elif a == 'ABC':
	print('ARC')
else:
	print('ABC')


S = input()
print(S[0] + ('R' if S[1] == 'B' else 'B') + S[2])


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


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


(A, X, C) = input()
print('A' + 'BR'[X == 'B'] + 'C')


a = input()[1]
print(f"A{('R' if a == 'B' else 'B')}C")


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


print('A' + 'RB'[input() == 'ARC'] + 'C')


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


dict = {'ABC': 'ARC', 'ARC': 'ABC'}
print(dict[input()])


n = input()
print(['ABC', 'ARC'][n == 'ABC'])


print('ABC' if input().strip() == 'ARC' else 'ARC')


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


print(['ARC', 'ABC'][input()[1] == 'R'])


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


list = ['ABC', 'ARC']
print(list[1 - list.index(input())])


print(f"A{'RB'['R' in input()]}C")


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


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


i = input()
o = 'ABC' if i == 'ARC' else 'ARC'
print(o)


c = {'ABC': 'ARC', 'ARC': 'ABC'}
s = input()
print(c[s])


print('A' + 'BR'[input() < 'AR'] + 'C')


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


s = input()
se = {'ABC', 'ARC'}
print(list(se - {s})[0])


a = ['ABC', 'ARC']
print(a[input() == 'ABC'])


print('ABC' if 'R' in input() else 'ARC')


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


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


print(['ABC', 'ARC'][input()[1] == 'B'])


s = {'ABC': 'ARC', 'ARC': 'ABC'}
print(s[input()])


def inN():
	return int(input())

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

def inNL(n):
	return [list(map(int, input().split())) for i in range(n)]
mod = pow(10, 9) + 7
s = input()
if s == 'ABC':
	print('ARC')
else:
	print('ABC')


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


import sys
from collections import deque, defaultdict, Counter
from itertools import accumulate, product, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right
from heapq import heappop, heappush
from math import ceil, floor, sqrt, gcd, inf
from copy import deepcopy
import numpy as np
import scipy as sp
INF = inf
MOD = 1000000007
s = input()
tmp = 0
res = 'ABC'
if s == 'ABC':
	res = 'ARC'
print(res)