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

import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]

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

Submission status: Accepted

Solution code:
t = input()
if t == '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()
if s[1] == "B":
    print("ARC")
elif 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:
def main():
    S = input()

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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin


def get_result(data):
    S = data[0]
    return 'ARC' if S == 'ABC' else 'ABC'


if __name__ == '__main__':
    data = list(map(str, stdin.readline().rstrip().split(' ')))
    result = get_result(data)
    print(result)

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
#import numpy as np
#import math
#from fractions import gcd

def main():

    ##get int
    #first_input = list(map(lambda x:int(x), input().split(" ")))
    #second_input = list(map(lambda x:int(x), input().split(" ")))

    ##get float
    #first_input = list(map(lambda x:float(x), input().split(" ")))
    #second_input = list(map(lambda x:float(x), input().split(" ")))

    ##get string
    first_input = input().split(" ")

    S = first_input[0]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

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


def main():
    S = input().strip()
    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:
import sys
from io import StringIO
import unittest

def resolve():
    s = input()

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

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """ABC"""
        output = """ARC"""
        self.assertIO(input, output)

if __name__ == "__main__":
    # unittest.main()
    resolve()

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:
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
def main():
    dic = {'ABC':'ARC', 'ARC':'ABC'}
    print(dic[input().rstrip()])

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#create date: 2020-05-03 21:00

import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

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:
from collections import defaultdict
from math import gcd
import time
import sys
from collections import Counter
import itertools
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
start = time.time()
# N = list(map(int, input()))[::-1]
N = input()

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

Submission status: Accepted

Solution code:
def main():
  S = str(input())

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


if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    from sys import stdin
    # from collections import defaultdict
    import math
    input = stdin.readline

    # import random

    a = input()[:3]
    if a == 'ARC':
        print('ABC')
    else:
        print('ARC')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input().rstrip()

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

Submission status: Accepted

Solution code:
import math

if __name__ == "__main__":
    S = input()
    if S == "ARC":
        ret = "ABC"
    else:
        ret = "ARC"
    print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

def main():
    s = readline().strip()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

if 'ABC' in s:
    print('ARC')
elif 'ARC' in s:
    print('ABC')

Submission status: Accepted

Solution code:
s= str(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s =input()

print('ABC' if s == 'ARC' else '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 == '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:
import math
import collections
#X=int(input())
# N,M,Q=map(int,input().split())
# S=[[]for i in range(Q)]
# for i in range(Q):
#     a=list(map(int,input().split()))
#     S[i]=a
# ans=0
# print()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys, bisect, math, itertools
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
    '''
    一つの整数
    '''
    return int(input())
def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_,s,_ = [i for i in input()]
if s=="B":
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np
if __name__ == "__main__":
    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:
def main(S):
    lst = ['ABC', 'ARC']
    if S == lst[0]:
        print(lst[1])
    else:
        print(lst[0])

if __name__ == '__main__':
    S = input()
    main(S)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

S = stdin.readline().rstrip()

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main
    #%%
    S = r()
    if S == 'ABC':
        print('ARC')
    else:
        print('ABC')

    #%%
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import re
import bisect

line = stdin.readline().rstrip()
if line == '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:
v = input()
if v == "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
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math

import itertools
import heapq
#import bisect

import copy
from functools import lru_cache

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]

def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)


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





if __name__ == "__main__":

    main()