Problem:


Score : 100 points

Problem Statement

Smeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.

You are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.

Constraints

1 ≦ x ≦ 3{,}000

x is an integer.

Input

The input is given from Standard Input in the following format:

x

Output

Print the answer.

Sample Input 1

1000

Sample Output 1

ABC

Smeke's current rating is less than 1200, thus the output should be ABC.

Sample Input 2

2000

Sample Output 2

ARC

Smeke's current rating is not less than 1200, thus the output should be ARC.



Sample input:
1000


Sample output:
ABC

Submission status: Accepted

Solution code:
# 053_a
x = int(input())
if (1 <= x & x <= 3000):
    if x < 1200:
        print('ABC')
    else:
        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():
    x = int(readline())

    if x < 1200:
        print("ABC")
    else:
        print("ARC")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
if int(input()) < 1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
x = int(input())

if x < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
def solve():
    x = int(input())
    if x < 1200:
        print('ABC')
    else:
        print('ARC')


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a = int(input())

print('ABC') if a < 1200 else print('ARC')

Submission status: Accepted

Solution code:
# A - ABC/ARC
# https://atcoder.jp/contests/abc053/tasks/abc053_a

x = int(input())

result = 'ARC'
if x < 1200:
    result = 'ABC'

print(result)

Submission status: Accepted

Solution code:
# レートによって出力を変更

x = int(input())

if x < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('AARBCC'[int(input())<1200::2])

Submission status: Accepted

Solution code:
x=int(input())
if x<1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
# すめけくんは現在のレートが 1200 未満ならば AtCoder Beginner Contest (ABC) に、
# そうでなければ AtCoder Regular Contest (ARC) に参加することにしました。 すめけくんの現在のレート x が与えられます。
# すめけくんが参加するコンテストが ABC ならば ABC と、そうでなければ ARC と出力してください。

x = int(input())

if x < 1200:
    print('ABC')

else:
    print('ARC')

Submission status: Accepted

Solution code:
# 入力
x = int(input())

# 処理
if x < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# レートを取得
x = int(input())

# レートに沿ったメッセージを出力
if x < 1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
# すめけくんは
# 現在のレートが 1200未満ならば AtCoder Beginner Contest (ABC) に、
# そうでなければ AtCoder Regular Contest (ARC) に参加することにしました。
# すめけくんの現在のレート xが与えられます。
# すめけくんが参加するコンテストが ABC ならば ABC と、そうでなければ ARC と出力してください。

# 制約
# 1 ≦ x ≦ 3,000
# x は整数

# 標準入力から x を取得する
x = int(input())

# レートを判定して結果を出力する
result = "ret"

if x < 1200:
    result = "ABC"
else:
    result = "ARC"

print(result)

Submission status: Accepted

Solution code:
s = int(input())

if s < 1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
x = int(input())
if x<1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
# 入力
x = int(input())

# xが1200未満ならABC、そうでなければARC
if x < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
x=int(input())

if x < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
x = input()
x = int(x)

if x < 1200:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

Solution code:
#
# abc053 a
#
import sys
from io import StringIO
import unittest


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 = """1000"""
        output = """ABC"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """2000"""
        output = """ARC"""
        self.assertIO(input, output)


def resolve():
    x = int(input())

    if x < 1200:
        print("ABC")
    else:
        print("ARC")


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

Submission status: Accepted

Solution code:
x = int(input())

if x >= 1200:
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
X = int(input())

if X < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
# A - ABC/ARC

# x=1200未満ならば'ABC'を、そうでなければ'ARC'を出力する


x = int(input())

if x < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
#入力
x = int(input())

# 出力
if x < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
S =int(input())

if  S < 1200 :
    result = "ABC"
else:
    result = "ARC"
print(result)

Submission status: Accepted

Solution code:
#   AtCoder abc053 a
#   ストレッチ課題

#   入力
x = int(input())

#   判定
if x < 1200:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

Solution code:
# 053a

x = int(input())    # レートxを代入

if x < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
x = int(input())

if x < 1200 :
    print( "ABC" )
else:
    print( "ARC" )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
x = int(x)
if x < 1200:
    print('ABC')
else:
    print("ARC")

Submission status: Accepted

Solution code:
if int(input()) < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
# A - ABC/ARC
def main():
    x = int(input())

    if x < 1200:
        print('ABC')
    else:
        print('ARC')
        
        
if __name__ == '__main__':
    main()

Submission status: Accepted

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


def main():
    x = int(input())
    if x < 1200:
        print("ABC")
    else:
        print("ARC")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
rate = int(input())
if rate < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
# すめけくんのレートxを整数で入力
x = int(input())

# レートが1200以下ならABCを出力、1200より大きければARCを出力
if x < 1200:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

Solution code:
a=int(input())
if a>=1200:
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

if x<1200:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

Solution code:
# A - ABC/ARC
#
# 現在のレートが 1200 未満ならば AtCoder Beginner Contest (ABC) に、
# そうでなければ AtCoder Regular Contest (ARC) に参加

# 現在のレート x が与えられる。

# 参加するコンテストが ABC ならば ABC
# そうでなければ、 ARC と出力

# x を標準入力から得る
x = int(input())
# print(x)

# x が 1200 未満なら ABC
# そうでなければ ARC
if x < 1200:
    answer = "ABC"
else:
    answer = "ARC"

# 結果を出力
print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if int(input()) < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
a = int(input())

if a < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
rating = input()
if int(rating) < 1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
x = int(input())
if x < 1200:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

Solution code:
x=int(input())
if x < 1200:
    ans="ABC"
else:
    ans="ARC"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
current_rating = int(input())

if current_rating < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
X = int(input())
if X < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
print 'ABC' if int(raw_input()) < 1200 else 'ARC'

Submission status: Accepted

Solution code:
print(['ARC','ABC'][int(input())<1200])

Submission status: Accepted

Solution code:
print('ABC'if int(input())<1200else'ARC')

Submission status: Accepted

Solution code:
r = int(input())

if r < 1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
x = int(input())
if x>=1200:
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
score = int(input())

if score < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
x = int(input())
print("ARC" if x >= 1200 else "ABC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
rating = int(input())
if(rating < 1200):
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
a = int(input())
if a >=1200:
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

Solution code:
x = int(input())
if x >= 1200:
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
if int(input())<1200:
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
if x>=1200:
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
rate = int(input())
if rate < 1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
n = int(input())
print('ABC' if n<1200 else 'ARC')

Submission status: Accepted

Solution code:
n = int(input())
if n < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
x = int(input())
if x<1200:
	print("ABC")
elif x>=1200:
	print("ARC")

Submission status: Accepted

Solution code:
rate = int(input())
if(rate < 1200):
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

Solution code:
if int(input()) < 1200:print('ABC')
else:print('ARC')

Submission status: Accepted

Solution code:
n = int(input())
if n < 1200:
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

Solution code:
print(["ARC","ABC"][int(input()) <1200])

Submission status: Accepted

Solution code:

def main():
    x = int(input())
    if x >= 1200:
        print('ARC')
    else:
        print('ABC')
    

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
if x<1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

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

x = int(input())
if (x < 1200):
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("A"+str(["R","B"][int(input())<1200])+"C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

print('ABC' if x < 1200 else 'ARC')

Submission status: Accepted

Solution code:
x = int(input())

print("ABC" if x < 1200 else "ARC")

Submission status: Accepted

Solution code:
x=int(input())
print("ABC" if x<1200 else "ARC")

Submission status: Accepted

Solution code:
x = int(input())
if x < 1200:
  print('ABC')
elif x>= 1200:
  print('ARC')

Submission status: Accepted

Solution code:
x=int(input())
if x<1200:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    x = int(input())
    if x < 1200:
        print("ABC")
    else:
        print("ARC")

resolve()

Submission status: Accepted

Solution code:
x = int(input())

if x<1200:
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

Solution code:
x=int(input())
if x<1200:
    print("ABC")
    exit()
print("ARC")

Submission status: Accepted

Solution code:
print("ABC") if int(input()) < 1200 else print("ARC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

if x < 1200:
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

Solution code:
a=int(input())

print('ABC' if a < 1200 else 'ARC')

Submission status: Accepted

Solution code:
x = int(input())

print("ABC" if (x < 1200) else "ARC")

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

    print('ABC' if n < 1200 else 'ARC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    x = I()

    if x < 1200:
        print('ABC')
    else:
        print('ARC')

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
print("ABC" if int(input())<1200 else "ARC")

Submission status: Accepted

Solution code:
if(int(input())<1200):
	print("ABC")
else:
	print("ARC")

Submission status: Accepted

Solution code:
x=int(input())
print("ABC" if x<1200 else "ARC")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def main():

    x = int(input())

    if x < 1200:
        ans = 'ABC'

    else:
        ans = 'ARC'

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
print("ABC" if x <1200 else "ARC")

Submission status: Accepted

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

x = I()
print('ABC' if x < 1200 else 'ARC')

Submission status: Accepted

Solution code:
w="B" if int(input())<1200 else "R"
print("A"+w+"C")

Submission status: Accepted

Solution code:
N = int(input())
if N >= 1200:
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    x = int(readline())
    
    if x < 1200:
        print('ABC')
    else:
        print('ARC')
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x=int(input())

if x<1200:
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

Solution code:
a = int(input())
print("ARC" if a>=1200 else "ABC")

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

Solution code:
if int(input())<1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    if(n<1200):
        print("ABC")
    else:
        print("ARC")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())
print("ABC" if a<1200 else "ARC")

Submission status: Accepted

Solution code:
x = int(input())
print("ABC" if x < 1200 else "ARC")

Submission status: Accepted

Solution code:
a = int(input())
if a < 1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
print(['ABC','ARC'][x>=1200])

Submission status: Accepted

Solution code:


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


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


def solve():
    x = read_int()
    if x < 1200:
        return 'ABC'
    return 'ARC'


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if int(input())<1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
rate = 1200

if x < rate:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
a = int(input())

if a<1200:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input());

if(x >= 1200):
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('AABRCC'[int(input())>=1200::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
print("ABC" if x<1200 else "ARC")

Submission status: Accepted

Solution code:
import sys;input = lambda : sys.stdin.readline()
print("ABC" if int(input()) < 1200 else "ARC")

Submission status: Accepted

Solution code:
x = int(input())
if x < 1200:print("ABC")
else:print("ARC")

Submission status: Accepted

Solution code:
x=int(input())

if x<1200:
    print("ABC")
    
else:
    print("ARC")

Submission status: Accepted

Solution code:
input_line = int(input())

if input_line >= 1200:
	print("ARC")
else:
	print("ABC")

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x = I()
if x < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
rating = int(input())


if 1 <= rating < 1200:
   print('ABC')
else:
   print('ARC')

Submission status: Accepted

Solution code:
#入力
rating = int(input())

#出力
if 1 <= rating < 1200:
   print('ABC')
else:
   print('ARC')

Submission status: Accepted

Solution code:
print(f"A{'RB'['1200'>input()]}C")

Submission status: Accepted

Solution code:
x = int(input())
#print(x)

if x < 1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    x = int(input())

    print('ABC') if x < 1200 else print('ARC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())
if x < 1200 :
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
print ("ABC") if int(input()) < 1200 else print ("ARC")

Submission status: Accepted

Solution code:
x = int(input())

if (x<1200):
    print("ABC")

else:
    print("ARC")

Submission status: Accepted

Solution code:
N = int(input())

if N < 1200:
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

Solution code:
def actual(x):
    if x < 1200:
        return 'ABC'

    return 'ARC'

x = int(input())
print(actual(x))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

if int(input()) < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
def main():
    x = int(input())
    if x >= 1200:
        print('ARC')
    else:
        print('ABC')
main()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import sys

rate = int(input())
if rate < 0 or rate > 3000:
    sys.exit()

if rate < 1200:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

Solution code:
if int(input())<1200:
  print("ABC")
else:
  print("ARC")

Submission status: Accepted

Solution code:
if 1200 > int(input()):
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
i = int(input())
if 1200 <= i:
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
x=int(input())
print("ABC"if x <1200 else"ARC")

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    x = int(input())
    print("ABC" if x < 1200 else "ARC")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
a=int(input())

if (a<1200):
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
if int(input()) < 1200: print('ABC')
else: print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[print("ABC") if int(input()) < 1200 else print("ARC")]

Submission status: Accepted

Solution code:
x = int(input())

print('ABC' if x < 1200 else 'ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

if x>=1200:
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
if x < 1200:
    print('ABC')
else:
    print("ARC")

Submission status: Accepted

Solution code:
x = int(input())
if(x < 1200):
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

Solution code:
x = int(input())
if 1 <= x <= 3000: 
  if x < 1200:
    print('ABC')
  else:
    print('ARC')

Submission status: Accepted

Solution code:
r = int(input())
if r < 1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

if x >= 1200:
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

Solution code:
print('ABC') if int(input()) < 1200 else print('ARC')

Submission status: Accepted

Solution code:
x = int(input())

if x < 1200:
    result = 'ABC'
else:
    result = 'ARC'

print(result)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = int(input())
if x < 1200:
  print('ABC')
else:
  print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
X = int(input())

print("ABC" if X < 1200 else "ARC")

Submission status: Accepted

Solution code:

x=int(input())
if x<1200:print('ABC')
else:print('ARC')

Submission status: Accepted

Solution code:
print("ABC"if int(input())<1200 else"ARC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if N<1200:
    print("ABC")
else:
    print("ARC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
def I(): return int(stdin.readline().rstrip())
x = I()

if x<1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
a = int(input())
print('ABC' if a<1200 else 'ARC')

Submission status: Accepted

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

def resolve():
    x=int(input())
    if x<1200:
        print('ABC')
    else:
        print('ARC')
resolve()

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    x = ii()
    print('ABC') if x < 1200 else print('ARC')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print("A"+"RB"[int(input())<1200]+"C")

Submission status: Accepted

Solution code:
sumeke=input()
sumeke=int(sumeke)
if sumeke < 1200:
	print("ABC")
else:
	print("ARC")

Submission status: Accepted

Solution code:
x = int(input())
def Main(x):
    return "ABC" if x < 1200 else "ARC"
    
print(Main(x))

Submission status: Accepted

Solution code:
if int(input()) <1200:
    print('ABC')
else:
    print('ARC')

Submission status: Accepted

Solution code:
# -*- coding: <encoding name> -*-

x = int(input())
print('ABC' if x < 1200 else 'ARC')