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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

if s == 'ABC':
    s = 'ARC'
else:
    s = 'ABC'

print(s)

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
if s=='ABC':
    print('ARC')
elif s=='ARC':
    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')
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:
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
#      .      '                    Udit Gupta @luctivud         ,              
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
                            ##     ##  #######  # #  ######
                            ##     ##  ##   ##  ###    ##
                            ##     ##  ##    #  # #    ##
                            #########  #######  # #    ##
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

import sys
import math as mt
# sys.setrecursionlimit(10**6)

def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))

def printwsp(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end="tst, ")

MOD = int(1e9+7); BABYMOD = 998244353;
# ################################ HELPER PROGRAMS USED ###################################
# ################################## MAIN STARTS HERE #####################################
# for _testcases_ in range(int(input())):
s=input()
if s=="ABC":
    print("ARC")
else:
    print("ABC")


# #########################################################################################
'''
THE LOGIC AND APPROACH WAS DEVELOPED BY ME @luctivud.
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
PLEASE DO NOT PLAGIARISE.
'''

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
input_test = input()

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

Submission status: Accepted

Solution code:
print("A"+{'B':'R','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:
s = input()

ans = "ABC"
if s == "ABC":
    ans = "ARC"

print(ans)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_AC = input()
AC = str(input_AC)

if AC == "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' :
    ans = 'ARC'
elif S[1] == 'R' :
    ans = 'ABC'

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

Submission status: Accepted

Solution code:
N = input()

if N == '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().rstrip('\n');
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())
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 =='ARC':
	print('ABC')
else:print('ARC')

Submission status: Accepted

Solution code:

S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = input()
if string.count("B") == 1:
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
 
def readInt():
	return int(input())
 
def readInts():
	return list(map(int, input().split()))
 
def readChar():
	return input()

def readChars():
	return input().split()
 
s = readChar()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

main()

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

Submission status: Accepted

Solution code:
#coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
# coding: utf-8
"""this is python work script"""
def solve(s):
    """solve problem"""
    if s == 'ABC':
        ans = 'ARC'
    else:
        ans = 'ABC'
    return ans

def main():
    """main function"""
    S = input().rstrip()
    answer = solve(S)
    print(answer)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = 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"ARC")

Submission status: Accepted

Solution code:
S=list(map(str,input()))
if S[1]=="B":
    print("ARC")
elif S[1]=="R":
    print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
#N, K = map(int, input().split())
# 文字列の入力
s = input()
#開業されたN個要素を受け付ける
#list = [input() for i in range(N)]


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# python3

#===============================================================================
from collections import defaultdict, Counter
from functools import lru_cache
from heapq import heappush, heappop
from math import gcd, floor, ceil
from sys import stdin, stdout

def ilist():
    return [int(x) for x in stdin.readline().strip().split(" ")]
def iint():
    return int(stdin.readline().strip())
def istr():
    return stdin.readline().strip()
##==============================================================================


def solve():
    pass


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

Submission status: Accepted

Solution code:
test = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor

def main():
    #N, M = map(int, input().split())
    S = input().strip()
    if S == 'ARC':
        print("ABC")
    else:
        print("ARC")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print('ABCARC'.replace(input(),''))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def input_from_console():
    s = input().rstrip()
    return s


def solve(s):
    if s == "ARC":
        return "ABC"
    return "ARC"

def main():
    s = input_from_console()
    print(solve(s))


if __name__ == "__main__":
    import sys

    if sys.gettrace():  # Check if the python interpreter is in debug mode or not.
        check_cases()
    else:
        main()

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

Submission status: Accepted

Solution code:
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest, nsmallest
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
# sys.setrecursionlimit(pow(10, 6))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(" ".join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


s = data()
if s == "ABC":
    out("ARC")
    exit()
out("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:
# 190503 A
if __name__ == "__main__":
    S = input()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')

Submission status: Accepted

Solution code:
S=input()

if S[1]=='R':
  S="ABC"
else:
  S="ARC"

print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)


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


def main():
    S = input().strip()
    print("ABC" if S == "ARC" else "ARC")
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

contest=["ABC","ARC"]

if S==contest[0]:
    print(contest[1])
else:
    print(contest[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


def main():
    s = input().strip()
    if s == 'ABC':
        print('ARC')
    else:
        print('ABC')


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
con=input()
if con=="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:
word = input()
if word == "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:
"""
AtCoder 社は、毎週土曜日にコンテストを開催しています。
コンテストには ABC と ARC の 2 つの種類があり、毎週どちらか一方が開催されます。
ABC が開催された次の週には ARC が開催され、ARC が行われた次の週には ABC が開催されます。

先週開催されたコンテストを表す文字列 S が与えられるので、今週開催されるコンテストを表す文字列を出力してください。
"""
s = input()
ans = 'ABC'
if s == 'ABC':
    ans = 'ARC'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#N, K = map(int, input().split()) 
S = input()

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

Submission status: Accepted

Solution code:
k =input()

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

MOD = 10 ** 9 + 7
RLIMIT = 1000
DEBUG = 1

def main():
    for _ in inputt(1):
        s, = inputs()
        if s == "ARC":
            print("ABC")
        else:
            print("ARC")




# region M


# region import

from math import *
from heapq import *
from itertools import *
from functools import reduce, lru_cache, partial
from collections import Counter, defaultdict
import re, copy, operator, cmath
import sys, io, os, builtins
sys.setrecursionlimit(RLIMIT)

# endregion

# region fastio

BUFSIZE = 8192
class FastIO(io.IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = io.BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(io.IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
    if args:
        sys.stdout.write(str(args[0]))
        split = kwargs.pop("split", " ")
        for arg in args[1:]:
            sys.stdout.write(split)
            sys.stdout.write(str(arg))
    sys.stdout.write(kwargs.pop("end", "\n"))
def debug(*args, **kwargs):
    if DEBUG and not __debug__:
        print("debug", *args, **kwargs)
        sys.stdout.flush()
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip()
inputt = lambda t = 0: range(t) if t else range(int(input()))
inputs = lambda: input().split()
inputi = lambda k = int: map(k, inputs())
inputl = lambda t = 0, k = lambda: list(inputi()): [k() for _ in range(t)] if t else list(k())

# endregion

# region bisect

def len(a):
    if isinstance(a, range):
        return -((a.start - a.stop) // a.step)
    return builtins.len(a)
def bisect_left(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if key(a[mid]) < x: lo = mid + 1
        else: hi = mid
    return lo
def bisect_right(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if x < key(a[mid]): hi = mid
        else: lo = mid + 1
    return lo
def insort_left(a, x, key = None, lo = 0, hi = None):
    lo = bisect_left(a, x, key, lo, hi)
    a.insert(lo, x)
def insort_right(a, x, key = None, lo = 0, hi = None):
    lo = bisect_right(a, x, key, lo, hi)
    a.insert(lo, x)
do_nothing = lambda x: x
bisect = bisect_right
insort = insort_right
def index(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi and key(a[i]) == x: return a[i]
    if default != None: return default
    raise ValueError
def find_lt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_le(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_gt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError
def find_ge(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError

# endregion

# region csgraph
# TODO

class Tree:
    def __init__(n):
        self._n = n
        self._conn = [[] for _ in range(n)]
        self._list = [0] * n
    def connect(a, b):
        pass

# endregion

# region ntheory

class Sieve:
    def __init__(self):
        self._n = 6
        self._list = [2, 3, 5, 7, 11, 13]
    def extend(self, n):
        if n <= self._list[-1]: return
        maxbase = int(n ** 0.5) + 1
        self.extend(maxbase)
        begin = self._list[-1] + 1
        newsieve = [i for i in range(begin, n + 1)]
        for p in self.primerange(2, maxbase):
            for i in range(-begin % p, len(newsieve), p):
                newsieve[i] = 0
        self._list.extend([x for x in newsieve if x])
    def extend_to_no(self, i):
        while len(self._list) < i: 
            self.extend(int(self._list[-1] * 1.5))
    def primerange(self, a, b):
        a = max(2, a)
        if a >= b: return
        self.extend(b)
        i = self.search(a)[1]
        maxi = len(self._list) + 1
        while i < maxi:
            p = self._list[i - 1]
            if p < b:
                yield p
                i += 1
            else: return
    def search(self, n):
        if n < 2: raise ValueError
        if n > self._list[-1]: self.extend(n)
        b = bisect(self._list, n)
        if self._list[b - 1] == n: return b, b
        else: return b, b + 1
    def __contains__(self, n):
        if n < 2: raise ValueError
        if not n % 2: return n == 2
        a, b = self.search(n)
        return a == b
    def __getitem__(self, n):
        if isinstance(n, slice):
            self.extend_to_no(n.stop + 1)
            return self._list[n.start: n.stop: n.step]
        else:
            self.extend_to_no(n + 1)
            return self._list[n]
sieve = Sieve()
def isprime(n):
    if n <= sieve._list[-1]:
        return n in sieve
    for i in sieve:
        if not n % i: return False
        if n < i * i: return True
prime = sieve.__getitem__
primerange = lambda a, b = 0: sieve.primerange(a, b) if b else sieve.primerange(2, a)
def factorint(n):
    factors = []
    for i in sieve:
        if n < i * i: break
        while not n % i:
            factors.append(i)
            n //= i
    if n != 1: factors.append(n)
    return factors
factordict = lambda n: Counter(factorint(n))

# endregion

# region main

if __name__ == "__main__":
    main()

# endregion


# endregion

Submission status: Accepted

Solution code:
def solve():
  s = input()
  if s == "ABC":
    print("ARC")
  else:
    print("ABC")
  return 0

 
if __name__ == "__main__":
  solve()

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

tmp = input()
if tmp == "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:
# -*- coding: utf-8 -*-
# 標準入力の取得
S = input()

# 求解処理
result = ""
if S == "ABC":
    result = "ARC"
elif S == "ARC":
    result = "ABC"

# 結果出力
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ref = ['ABC', 'ARC']
ref.remove(S)
print(ref[0])

Submission status: Accepted

Solution code:
A = str(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:
#!/usr/bin/python3

#標準出力からの読み込み
input = input()

#判定ロジック
if input == "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')
else:
  print('ABC')

Submission status: Accepted

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