import sys

from math import sqrt

from collections import Counter, defaultdict, deque



input = sys.stdin.readline

sys.setrecursionlimit(10 ** 6)





def I():

    return int(eval(input()))





def MI():

    return list(map(int, input().split()))





def LI():

    return list(MI())





def LIN(n: int):

    return [I() for _ in range(n)]





inf = float("inf")

mod = 10 ** 9 + 7





def main():

    s = input().rstrip()

    if s == "ABC":

        print("ARC")

    else:

        print("ABC")





if __name__ == "__main__":

    main()

#!/usr/bin/env python3

import sys





def solve(S: str):

    if S == "ABC":

        print("ARC")

    else:

        print("ABC")

    return





# Generated by 1.1.7.1 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()

import sys
from math import sqrt
from collections import Counter, defaultdict, deque

input = sys.stdin.readline
sys.setrecursionlimit(10**6)


def I():
    return int(eval(input()))


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


def LI():
    return list(MI())


def LIN(n: int):
    return [I() for _ in range(n)]


inf = float("inf")
mod = 10**9 + 7


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


if __name__ == "__main__":
    main()

#!/usr/bin/env python3
import sys


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


# Generated by 1.1.7.1 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()

+#!/usr/bin/env python3 -from math import sqrt -from collections import Counter, defaultdict, deque - -input = sys.stdin.readline -sys.setrecursionlimit(10**6) -def I(): -    return int(eval(input())) - - -def MI(): -    return list(map(int, input().split())) - - -def LI(): -    return list(MI()) - - -def LIN(n: int): -    return [I() for _ in range(n)] - - -inf = float("inf") -mod = 10**9 + 7 - - -def main(): -    s = input().rstrip() -    if s == "ABC": +def solve(S: str): +    if S == "ABC": +    return + + +# Generated by 1.1.7.1 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)