Problem:


Score : 100 points

Problem Statement

A programming competition site AtCode regularly holds programming contests.

The next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.

The contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.

The contest after the ARC is called AGC, which is rated for all contestants.

Takahashi's rating on AtCode is R. What is the next contest rated for him?

Constraints

0 ≤ R ≤ 4208

R is an integer.

Input

Input is given from Standard Input in the following format:

R

Output

Print the name of the next contest rated for Takahashi (ABC, ARC or AGC).

Sample Input 1

1199

Sample Output 1

ABC

1199 is less than 1200, so ABC will be rated.

Sample Input 2

1200

Sample Output 2

ARC

1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.

Sample Input 3

4208

Sample Output 3

AGC



Sample input:
1199


Sample output:
ABC

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import  stdin
A = (int)(input())
if A<1200:
    print("ABC")
elif A<2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    r = int(input())

    if r >= 2800:
        print('AGC')
    elif r >= 1200:
        print('ARC')
    else:
        print('ABC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
R = int(input())

if 0 <= R < 1200:
    print('ABC')
elif 1200 <= R < 2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

Solution code:
r = int(input())
if r < 1200:
  print('ABC')
elif r < 2800:
  print('ARC')
elif r <= 4208:
  print('AGC')

Submission status: Accepted

Solution code:
R=int(input())

if R<1200:
  print('ABC')
elif R<2800:
  print('ARC')
else:
  print('AGC')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())


if N < 1200:
    print("ABC")
elif N < 2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

Solution code:
r = int(input())

if r < 1200:
    print('ABC')
elif 1200<=r<2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

r = int(input())

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

Submission status: Accepted

Solution code:

r=int(input())

if r<1200:print('ABC')
elif r<2800:print('ARC')
else:print('AGC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R = int(input())
if R < 1200:
    print('ABC')
elif R >= 1200 and R < 2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

Solution code:
R = int(input())
if R<1200:
    print('ABC')
elif R<2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

Solution code:
r = int(input())

if r < 1200:
  print('ABC')
  exit()
elif r < 2800:
  print('ARC')
  exit()
else:
  print('AGC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# input
R = int(input())

# check
if R < 1200:
    print("ABC")
elif R < 2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
ans = 'ARC'
if r < 1200: ans = 'ABC'
elif 2800 <= r: ans = 'AGC'
print(ans)

Submission status: Accepted

Solution code:
r = int(input())
ans = 'AGC'
if r < 1200: ans = 'ABC'
if 1200 <=r and r < 2800: ans = 'ARC'
print(ans)

Submission status: Accepted

Solution code:
# 1200
# 2800
# ABC, ARC, AGC
r = int(input())
ans = 'AGC'
if r < 1200: ans = 'ABC'
if 1200 <=r and r < 2800: ans = 'ARC'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())
if(r<1200):
    print("ABC")
elif(r<2800):
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

Solution code:
rate = int(input())

if rate < 1200:
    print('ABC')
elif rate < 2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

Solution code:
r=int(input())
if r<1200:
	print("ABC")
elif r<2800:
	print("ARC")
else:
	print("AGC")

Submission status: Accepted

Solution code:
r=int(input())
if r<1200:
  print("ABC")
elif 1200<=r<2800:
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

Solution code:
def resolve():
	r = int(input())
	if r < 1200:
		return print('ABC')
	if r < 2800:
		return print('ARC')
	else:
		return print('AGC')
resolve()

Submission status: Accepted

Solution code:
R = int(input())
if R<1200:
    print("ABC")
elif R<2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    R = int(input())
    ans = "ABC" if R < 1200 else "ARC" if R < 2800 else "AGC"
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())
if r <1200:
    print("ABC")
elif 1200 <=r <2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

Solution code:
A=int(input())
if A>2799:
   print("AGC")
elif 2800>A>1199:
   print("ARC")
else:
   print("ABC")

Submission status: Accepted

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

Submission status: Accepted

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

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

R = ir()
target = np.array([1200, 2800])
i = np.searchsorted(target, R, side='right')
answer = ['ABC', 'ARC', 'AGC'][i]
print(answer)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
from bisect import bisect_left, bisect_right

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

R = ir()
target = [1200, 2800]
i = bisect_right(target, R)
answer = ['ABC', 'ARC', 'AGC'][i]
print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18
# ----------------------------------------------------------- #

r = I()
if r < 1200:
    print('ABC')
elif 1200 <= r < 2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

Solution code:
R = int(input())
if R< 1200:
  print('ABC')

elif 1200<= R < 2800:
  print('ARC')
  
else:
  print('AGC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
if r < 1200:
  print("ABC")
elif 1200 <= r < 2800:
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R = int(input())
if R<1200:
  print("ABC")
elif R<2800:
  print("ARC")
else :
  print("AGC")

Submission status: Accepted

Solution code:
r = int(input())
print("ABC"*(r<1200)+"ARC"*(1200<=r<2800)+"AGC"*(r>=2800))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())

if r<1200:
  print('ABC')
elif 1200<=r and r<2800:
  print('ARC')
else:
  print('AGC')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed May 13 16:12:33 2020

@author: shinba
"""

r = int(input())

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

Submission status: Accepted

Solution code:
def q1():
    R = int(input())
    if R < 1200:
        return 'ABC'
    elif R < 2800:
        return 'ARC'
    else:
        return 'AGC'

if __name__ == "__main__":
    print(q1())

Submission status: Accepted

Solution code:
R = int(input())

if R>=2800:
  print("AGC")
  exit()
if R<1200:
  print("ABC")
  exit()
print("ARC")

Submission status: Accepted

Solution code:
N = int(input())

ans = ['ABC', 'ARC', 'AGC']

if N < 1200:
  print(ans[0])
elif N < 2800:
  print(ans[1])
else:
  print(ans[2])

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    n = int(input())
    if n < 1200:
        print('ABC')
    elif n < 2800:
        print('ARC')
    else:
        print('AGC')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
R = int(input())
if R < 1200:
	print("ABC")
elif R < 2800:
	print("ARC")
else:
	print("AGC")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(100000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():  
    R = int(input())
    if R < 1200:
        print('ABC')
    elif R < 2800:
        print('ARC')
    else:
        print('AGC')
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
R = int(input())
ans = ""

if R < 1200:
    ans = "ABC"
elif R < 2800:
    ans = "ARC"
else:
    ans = "AGC"


print(ans)

Submission status: Accepted

Solution code:
# a,b = map(int, input().split())
R = int(input())
# B = int(input())
# C = int(input())
# X = input()
print("ABC" if R < 1200 else "ARC" if R < 2800 else "AGC")

Submission status: Accepted

Solution code:
R = int(input())

if (R < 1200):
  print("ABC")
elif (R < 2800):
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ABC_104_A():
    R = int(input())

    if R < 1200:
        print('ABC')
    elif R < 2800:
        print('ARC')
    else:
        print('AGC')

if __name__ == '__main__':

    ABC_104_A()

Submission status: Accepted

Solution code:
R=int(input())
if R < 1200: print('ABC')
elif R < 2800: print('ARC')
else: print('AGC')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
r = int(input()) 
if r < 1200:
    print("ABC")
elif r < 2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
R = ri()
print('ABC' if R < 1200 else 'ARC' if R < 2800 else 'AGC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

rate = [1200, 2800, 4209]
contest = ['ABC', 'ARC', 'AGC']

for i in range(3):
    if r < rate[i]:
        break
print(contest[i])

Submission status: Accepted

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

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, 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 operator import itemgetter              # itemgetter(1), itemgetter('key')
# 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 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 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 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 copy import deepcopy                    # to copy multi-dimentional matrix without reference
# 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())
    
    
    r = ii()
    if r < 1200:
        print('ABC')
    elif r < 2800:
        print('ARC')
    else:
        print('AGC')


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    R = int(input())

    if(R < 1200):
        print("ABC")
    elif(R < 2800):
        print("ARC")
    else:
        print("AGC")

main()

Submission status: Accepted

Solution code:
def main():
    R = int(input())
    if(R < 1200):
        print("ABC")
    elif(R<2800):
        print("ARC")
    else:
        print("AGC")

main()

Submission status: Accepted

Solution code:
R = int(input())

if (R >= 2800):
    print('AGC')
elif (R >= 1200 and R < 2800):
    print('ARC')
else:
    print('ABC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:

R = int(input())
print("ABC" if R < 1200 else "ARC" if R < 2800 else "AGC")

Submission status: Accepted

Solution code:
r=int(input())
if r<1200:
    ans="ABC"
elif r<2800:
    ans="ARC"
else:
    ans="AGC"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R = int(input())
print("ABC" if R<1200 else "ARC" if R>=1200 and R<2800 else("AGC"))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

# https://atcoder.jp/contests/abc104
# 16:23-


def main():
    r = int(input())
    if r < 1200:
        return "ABC"
    elif r < 2800:
        return "ARC"
    else:
        return "AGC"


print(main())

Submission status: Accepted

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

R = int(input())

if R < 1200:
    print("ABC")
elif R < 2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

Solution code:
r=int(input())

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

Submission status: Accepted

Solution code:

r = int(input())

if r >= 2800:
  print("AGC")
elif r >= 1200:
  print("ARC")
else:
  print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
N = int(input())
if N < 1200:
    print("ABC")
elif N < 2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

Solution code:
r = int(input())
if r < 1200:
  print("ABC")
elif r < 2800:
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

Solution code:
# ABC104A

r = int(input())
if r < 1200:
    print('ABC')
elif r < 2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R = int(input())

if R < 1200:print('ABC')
elif R < 2800: print('ARC')
else:print('AGC')

Submission status: Accepted

Solution code:
r = int(input())

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

Submission status: Accepted

Solution code:
R = int(input())

print('ABC' if R <1200 else 'ARC' if R < 2800 else 'AGC')

Submission status: Accepted

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

def resolve():
    r=int(input())
    if r<1200:
        print('ABC')
    elif 1200<=r<2800:
        print('ARC')
    else:
        print('AGC')
resolve()

Submission status: Accepted

Solution code:
n = int(input())
if n < 1200:
    print('ABC')
elif n >= 1200 and n < 2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R = int(input())
if R<1200:
  print("ABC")
elif R<2800:
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

Solution code:
r = int(input())
if r < 1200:
    print("ABC")
elif r < 2800:
    print("ARC") 
else:
    print("AGC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import sys

n = int(input())

if n < 1200:
    print("ABC")
elif n < 2800:
    print("ARC")
else:
    print("AGC  ")

Submission status: Accepted

Solution code:
def main():
    n = int(input())

    if n >= 2800:
        print('AGC')
    elif n >= 1200:
        print('ARC')
    else:
        print('ABC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

R = INT()
if R < 1200:
	print("ABC")
	exit()
elif R < 2800:
	print("ARC")
	exit()
else:
	print("AGC")

Submission status: Accepted

Solution code:
def get_contest(r):
    if r < 1200:
        print('ABC')
    elif r<2800:
        print('ARC')
    else:
        print('AGC')
        
R=int(input())

get_contest(R)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

if r<1200:
  print('ABC')
elif r<2800:
  print('ARC')
else:
  print('AGC')

Submission status: Accepted

Solution code:
R = int(input())
if R < 1200:
    print("ABC")
    
elif R < 2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    R = int(input())
    if R < 1200:
        print("ABC")
    elif R < 2800:
        print("ARC")
    else:
        print("AGC")
if __name__ == "__main__":
    main()

Submission status: Accepted

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


def solve(R: int):
    if R < 1200:
        print('ABC')
    elif R < 2800:
        print('ARC')
    else:
        print('AGC')
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    R = int(next(tokens))  # type: int
    solve(R)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r=input()
r=int(r)
if(r<1200):
  print("ABC")
elif(r<2800):
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    r = int(input())
    if r<1200:
        print('ABC')
    elif r<2800:
        print('ARC')
    else:
        print('AGC')
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
R = int(input())
if R < 1200:
  print("ABC")
elif R>=1200 and R<2800:
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

Solution code:
r = int(input())

if r < 1200:
    print("ABC")

elif r >= 1200 and r < 2800:
    print("ARC")

elif r >= 2800:
    print("AGC")

Submission status: Accepted

Solution code:
r=int(input())

if r<1200:
  print("ABC")
elif r>=2800:
  print("AGC")
else:
  print("ARC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R = int(input())
if R < 1200: print('ABC')
elif R < 2800: print('ARC')
else: print('AGC')

Submission status: Accepted

Solution code:
r  = int(input())
if r < 1200:
    print("ABC")
elif r < 2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

Solution code:
R = int(input())

if R < 1200:
  print("ABC")
  
elif R < 2800:
  print("ARC")
  
else:
  print("AGC")

Submission status: Accepted

Solution code:
R = int(input())
if R < 1200:
  print("ABC")
elif R >= 1200 and R < 2800:
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

Solution code:
R = int(input())

if R < 1200:
  print("ABC")
elif 1200 <= R < 2800:
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
if r < 1200: print("ABC")
elif r < 2800: print("ARC")
else: print("AGC")

Submission status: Accepted

Solution code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

r = ni()
if r < 1200:
    print('ABC')
elif r < 2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

Solution code:
R = int(input())

if R < 1200:
    print('ABC')
elif 1200 <= R < 2800:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    r=int(input())
    if r<1200:
        print("ABC")
    elif r<2800:
        print("ARC")
    else:
        print("AGC")

Submission status: Accepted

Solution code:
R = int(input())
print('ABC' if 0<=R<1200 else'ARC' if R<2800 else 'AGC')

Submission status: Accepted

Solution code:
n = int(input())

if n < 1200:
  print("ABC")
elif n < 2800:
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import collections
import sys

#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

r=I()
if r<1200:
    print("ABC")
elif r<2800:
    print("ARC")
else:
    print("AGC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

r = int(input())

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

Submission status: Accepted

Solution code:
R = int(input())
print(["ARC","ABC","AGC"][R<1200 or -(R>=2800)])

Submission status: Accepted

Solution code:
R=int(input())
if R<1200:
    print('ABC')
elif 2800>R>=1200:
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':

	n = int(input())
	if n < 1200:	print("ABC")
	elif n < 2800:	print("ARC")
	else:			print("AGC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
R = int(input())

if R <= 1199:
  print("ABC")
elif R <= 2799:
  print("ARC")
else:
  print("AGC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R = int(input())
if R < 1200: print("ABC")
elif R < 2800: print("ARC")
else: print("AGC")

Submission status: Accepted

Solution code:
R = int(input())
if (R<1200):
    print('ABC')
elif (1200<=R) and (R<2800):
    print('ARC')
else:
    print('AGC')

Submission status: Accepted

Solution code:
r=int(input())

if r>=2800:
    print("AGC")
elif r>=1200:
    print("ARC")
else:
    print("ABC")

Submission status: Accepted

Solution code:
R = int(input())
if R < 1200:
    print('ABC')
elif R >= 2800:
    print('AGC')
else:
    print('ARC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R = int(input())
if(R < 1200):
    print("ABC")
elif(R < 2800):
    print("ARC")
else:
    print("AGC")