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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input()

if data.lower() == 'abc':
  print('ARC')
else:
  print('ABC')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
input1 = input().rstrip()
if input1=="ABC":
    print("ARC")
elif input1=="ARC":
    print("ABC")
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ABC="ABC"
ARC="ARC"

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect

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


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


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


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


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    s = S()
    if s == ['A','B','C']:
        print('ARC')
    else:
        print('ABC')
    return


if __name__ == "__main__":
    solve()

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

Submission status: Accepted

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

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

mid = "B" if prev[1] == "R" else "R"

print("A" + mid + "C")

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    S = input().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import math
import copy

#n = int(input())
#n, k = [int(i) for i in input().split()]
#table = [[int(i) for i in input().split()] for j in range(n)]
#table = [list(input()) for n in range(h)]
#num = [int(i) for i in input().split()]
#num = [int(i) for i in range(n)]
# s = [input() for i in range(n)]
s = input()
# list = list(s)
# dp = [[0 for _ in range(2)] for _ in range(13)]
#s = [input() for i in range(n)]

#a = [[0 for _ in range(n+1)] for _ in range(n+1)]
#b = [[0 for _ in range(n+1)] for _ in range(n+1)]

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:
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 = input()
assert S == "ABC" or "ARC", "Sは、ABCまたは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()

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:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

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


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


def main():
    S = sys.stdin.readline().strip()  # type: str
    solve(S)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

Lastcontest=input()

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

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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
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 LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
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 S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
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":
        return "ARC"

    return "ABC"


print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

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

Submission status: Accepted

Solution code:

if str(input()) == '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()
S_=['ABC', 'ARC']
if(S==S_[0]):
    print(S_[1])
if(S==S_[1]):
    print(S_[0])

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    S = input().strip()
    if S == 'ABC':
       return 'ARC'
    return 'ABC'


if __name__ == '__main__':
    print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil,gcd
# from itertools import permutations as permus
# from collections import deque,Counter
# import re
# from functools import lru_cache # 簡単メモ化 @lru_cache(maxsize=1000)
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import networkx as nx
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix
# from scipy.special import comb

# slist = "abcdefghijklmnopqrstuvwxyz"
S = input()
if S =="ABC":
    print("ARC")
else:
    print("ABC")
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(ans))

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
S = input()

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x=input();

if x == "ABC" :
 	print("ARC");
    
elif x == "ARC" :
 	print("ABC");

Submission status: Accepted

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

Submission status: Accepted

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

culc(input())

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[1] == "R"):
  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:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n=int(input())
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputStr = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = ["ABC", "ARC"]
if input() == data[0]:
  print(data[1])
else:
  print(data[0])

Submission status: Accepted

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


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


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

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

Submission status: Accepted

Solution code:
import sys

if sys.stdin.readline().split()[0] == 'ARC':
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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")
elif(s=="ABC"):
    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().count("R")

if S == 1:
    print("ABC")

else:
    print("ARC")

Submission status: Accepted

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

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

else:
    print("ABC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - A?C

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

Submission status: Accepted

Solution code:
# A - A?C
if input() == '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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    s = input()
    if s[1] == 'R':
        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().rstrip()
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:
a, b = 'ABC', 'ARC'
print({a:b,b:a}[input()])

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().strip()
s = input()
if s=="ABC":
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
print(*{'ABC','ARC'}-{input()})

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

Solution code:
# A - A?C
def main():
    S = input().rstrip()
    print("ABC" if S == "ARC" else "ARC")


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
  run()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
a = str(a)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lastWeek = input()

thisWeek = "ABC" if (lastWeek == "ARC") else "ARC"

print(thisWeek)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
date=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def nextweek(S):
  if( S == "ABC"):
    return "ARC"
  else:
    return "ABC"



S = input()
print (nextweek(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import time
startTimeProblem=time.time()

import fileinput, sys, itertools, functools
from math import *
from bisect import *
from heapq import *
from collections import *

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

class InputHelper:
    def __init__(self):
        self.myinput = fileinput.input()

    def isLocal(self):
        return not fileinput.isstdin()

    def int(self):
        return int(self.myinput.readline().rstrip())

    def ints(self):
        return [int(_) for _ in self.myinput.readline().rstrip().split()]

    def str(self):
        return self.myinput.readline().rstrip()

    def strs(self):
        return [_ for _ in self.myinput.readline().rstrip().split()]

class OutputHelper:
    def int(self, a):
        print(a)    

    def ints(self, a):  
        print(" ".join([str(_) for _ in a]))
    
    def intsNL(self, a):
        for _ in a:
            print(_)
    
    def str(self, s):
        print(s)

    def strs(self, s):
        print(" ".join([_ for _ in s]))

    def strsNL(self, s):
        for st in s:
            print(st)

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None

In = InputHelper()
Out = OutputHelper()

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

if In.str() == "ABC":
    Out.str("ARC")
else:
    Out.str("ABC")


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

if len(sys.argv)>2 and sys.argv[2]=="TIMEIT":
    fin = (time.time()-startTimeProblem)*1000
    print("{:.2f}".format(fin) + "ms")

Submission status: Accepted

Solution code:
import sys

def solve():
    S = input().strip("\n")
    if S[1] == "B": print("ARC")
    else: print("ABC")

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
input_l = input()

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

Submission status: Accepted

Solution code:
s = input()
dic = {}
dic["ARC"] = "ABC"
dic["ABC"] = "ARC"
print(dic[s])

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

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

Submission status: Accepted

Solution code:
B = 'ABC'
R = 'ARC'

S = input()

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

Submission status: Accepted

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

s = read().rstrip().decode()
if s[1] == 'B':
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

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

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

Submission status: Accepted

Solution code:
# abc166_a.py
S = input()
if S =="ABC":
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
print(["ARC","ABC"]["R" in input()])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('ABC'if input()[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()
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:
import sys
input = sys.stdin.readline

# from collections import deque

def linput(_t=int):
    return list(map(_t, input().split()))

def gcd(n,m):
    while m: n,m = m, n%m
    return n

def lcm(n,m): return n*m//gcd(n,m)

def main():

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

    # print(("No","Yes")[res%2])


main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    print("ABC" if input() == "ARC" else "ARC")
resolve()

Submission status: Accepted

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