Problem:


Score : 100 points

Problem Statement

Decades have passed since the beginning of AtCoder Beginner Contest.

The contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?

In the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.

You are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.

Constraints

1 \leq N \leq 1998

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.

Sample Input 1

999

Sample Output 1

ABC

The 999-th round of AtCoder Beginner Contest is labeled as ABC999.

Sample Input 2

1000

Sample Output 2

ABD

The 1000-th round of AtCoder Beginner Contest is labeled as ABD001.

Sample Input 3

1481

Sample Output 3

ABD

The 1481-th round of AtCoder Beginner Contest is labeled as ABD482.



Sample input:
999


Sample output:
ABC

Submission status: Accepted

Solution code:
n=int(input())

if n<=999:
    print('ABC')

elif 999<n:
    print('ABD')

Submission status: Accepted

Solution code:
N=int(input())

if 1<=N<=999:
	print("ABC")
elif 999<N<=1998:
 	print("ABD")

Submission status: Accepted

Solution code:
print("ABC") if int(input()) < 1000 else print("ABD")

Submission status: Accepted

Solution code:
N = int(input())

if 1000 <= N <=1998:
    print("ABD")

else:
    print("ABC")

Submission status: Accepted

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


def main():
    N = int(input())
    if N >= 1000: print("ABD")
    else: print("ABC")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

n = int(input())

if (n // 1000) == 0:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
print('ABC'*(len(input())<4)or'ABD')

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

N = i()
if N < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
A = int(input())

print('ABC' if A < 1000 else 'ABD')

Submission status: Accepted

Solution code:
print('ABD'if int(input())>999else'ABC')

Submission status: Accepted

Solution code:
print("ABC"if int(input())<=999 else "ABD")

Submission status: Accepted

Solution code:
n = int(input())
if n < 1000:
	print("ABC")
else:
	print("ABD")

Submission status: Accepted

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

N = int(input())

if N < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
print("ABC" if int(input())<=999 else "ABD")

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    if N >= 1000:
        print('ABD')
    else:
        print('ABC')
main()

Submission status: Accepted

Solution code:
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    N = input_number()
    print("AABBCD"[N > 999::2])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
if int(input())<=999:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n=int(input())
if n>=1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n = int(input())
print("ABD" if n > 999 else "ABC")

Submission status: Accepted

Solution code:
N=int(input())
if N<1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n=int(input())
if n - 999 > 0:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

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

# check
if N < 1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

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

n = int(input())
if n < 1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
n=int(input())
print('ABC' if n < 1000 else 'ABD')

Submission status: Accepted

Solution code:
a=int(input())
if a < 1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n = int(input())

if 1 <= n and n <= 999:
    print('ABC')
elif 1000 <= n and n <= 1998:
    print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
if n >= 1000:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
N = int(input())
if N >= 1000:
    N += 1
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
n = int(input())

if n > 999:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
N=int(input())
if N<1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N < 1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n = int(input())
print ('ABC') if n <= 999 else print ('ABD')

Submission status: Accepted

Solution code:
n = int(input())

if n <= 999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())

print("ABC" if n < 1000 else "ABD")

Submission status: Accepted

Solution code:
def actual(n):
    if 1 <= n <= 999:
        return 'ABC'

    return 'ABD'

n = int(input())
print(actual(n))

Submission status: Accepted

Solution code:
n = int(input())

if n < 1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
N = int(input())

if N<=999:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
N = int(input())

print('ABC' if 1 <= N <= 999 else 'ABD')

Submission status: Accepted

Solution code:
n = int(input())

if n >= 1000:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

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

    if n >= 1000:
        print('ABD')
    else:
        print('ABC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

if (N >= 1000):
    ans = 'ABD'
else:
    ans = 'ABC'

print(ans)

Submission status: Accepted

Solution code:
a = int(input())
print("ABC" if a <= 999 else "ABD")

Submission status: Accepted

Solution code:
n=int(input())

if n<1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())

if n < 1000:
    ans = "ABC"
else:
    ans = "ABD"
print(ans)

Submission status: Accepted

Solution code:
N = input()
n = len(N)
ans = 'ABC'
if n > 3:
  ans = 'ABD'
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
if n<1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
print("ABC" if len(str(n))<=3 else "ABD")

Submission status: Accepted

Solution code:
print("ABC" if int(input())<1000 else "ABD")

Submission status: Accepted

Solution code:
n = int(input())

print("ABC" if n<1000 else "ABD")

Submission status: Accepted

Solution code:
N = int(input())
print('ABC' if N<1000 else 'ABD')

Submission status: Accepted

Solution code:
n=int(input())
if n<=999:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
N=int(input())

if N<1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
if n >= 1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n = int(input())
if n<=999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
print('ABC' if n<1000 else 'ABD')

Submission status: Accepted

Solution code:
print("AB"+"CD"[len(input())==4])

Submission status: Accepted

Solution code:
n = int(input())
print('ABC' if n < 1000 else 'ABD')

Submission status: Accepted

Solution code:
N_str = input()
N = int(N_str)

if N <= 999:
    print('ABC')
elif N > 999:
    print('ABD')

Submission status: Accepted

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

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


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

i = (N-1) // 999

print("AB" + "CD"[i])

Submission status: Accepted

Solution code:
n = int(input())
if 1 <= n <= 999:
  print('ABC')
elif 1000 <= n <= 1998:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
print("ABC" if n <= 999 else"ABD")

Submission status: Accepted

Solution code:
N = int(input())

ans = "ABC" if N <= 999 else "ABD"
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

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

N = ir()
answer = 'ABC' if N < 1000 else 'ABD'
print(answer)

Submission status: Accepted

Solution code:
n = input()
if len(n) == 4:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

Solution code:
n = int(input())
if n<1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
from sys import stdin

A = (int)(input())
if (A < 1000):
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
n = int(input())
print('ABD' if n > 999 else 'ABC')

Submission status: Accepted

Solution code:
n = int(input())
if n < 1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n=int(input())
if n<1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n=int(input())
if n>=1000:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
n=int(input())
print("ABC" if n<=999 else "ABD")

Submission status: Accepted

Solution code:
n = int(input())

if 1 <= n <= 999:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n = int(input())

if n >= 1000:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

Solution code:

n=int(input())

print('ABC' if 1<=n<=999 else 'ABD')

Submission status: Accepted

Solution code:
N=int(input())
if N<=999:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
if int(input())<1000: print("ABC");
else: print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n = int(input())

if n < 1000:
    ans = "ABC"
else:
    ans = "ABD"
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

if n>=1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


n = I()
if n >= 1000:
    ans = 'ABD'
    if len(str(n - 999)) == 1:
        ans += '00' + str(n - 999)
    elif len(str(n - 999)) == 2:
        ans += '0' + str(n - 999)
    else:
        ans += str(n - 999)

else:
    ans = 'ABC'
    if len(str(n)) == 1:
        ans += '00' + str(n)
    elif len(str(n)) == 2:
        ans += '0' + str(n)
    else:
        ans += str(n)
print(ans[:3])

Submission status: Accepted

Solution code:
N = int(input())
if N // 1000 == 0:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n = int(input())
if n < 1000: print('ABC')
else: print('ABD')

Submission status: Accepted

Solution code:
n=int(input())
print('ABC' if n<1000 else 'ABD')

Submission status: Accepted

Solution code:
n = int(input())
if n > 999:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n = input()
if len(n) < 4:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

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

def VI(N, init=0):
  return [init for _ in range(N)]
def VVI(N, M, init=0):
  return [[init for _ in range(M)] for _ in range(N)]

def VD(N, init=0.0):
  return [init for _ in range(N)]
def VVD(N, M, init=0.0):
  return [[init for _ in range(M)] for _ in range(N)]

def Decimal(x):
  print("{0:.10f}".format(x))

class Pair:
  def __init__(self, x=0, y=0):
    self.first = x
    self.second = y

  def __repr__(self):
    return '{0} {1}'.format(self.first, self.second)

  def __lt__(self, pi):
    return self.first < pi.second

def POW(x, n):
  ret = 1
  while n:
    if n&1:
      ret *= x
    x *= x
    n >>= 1
  return ret

N = int(input().rstrip())
if N < 1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n=int(input())
if n<=999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
print("ABC" if n / 999 <= 1 else "ABD")

Submission status: Accepted

Solution code:
s = int(input())

if s >= 1000:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

Solution code:
N = int(input())
if N<=999:
  print("ABC")
else:
  print("ABD")

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())
    
    
    n = ii()
    print('ABD') if n >= 1000 else print('ABC')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
if n>=1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
if int(input())>999:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
print("ABD" if 999 < int(input()) else "ABC")

Submission status: Accepted

Solution code:
N=int(input())
if(N<1000):
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
def resolve():
	n = int(input())
	if n > 999:
		print('ABD')
	else:
		print('ABC')
resolve()

Submission status: Accepted

Solution code:
a=int(input())
if a<=999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(['ABD', 'ABC'][int(input()) <= 999])

Submission status: Accepted

Solution code:
n=int(input())
if n>=1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
a = int(input())
if (a < 1000):
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
n = int(input())
ans = 'AB'
if n <= 999:
  ans += 'C'
else:
  ans += 'D'
print(ans)

Submission status: Accepted

Solution code:
print("ABD" if int(input())>999 else "ABC")

Submission status: Accepted

Solution code:
if int(input()) >=1000:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
if int(input()) <= 999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
# a,b = map(int, input().split())
N = int(input())
# B = int(input())
# C = int(input())
# X = input()
print("ABC" if N < 1000 else "ABD")

Submission status: Accepted

Solution code:
N = int(input())
print('ABD') if N >= 1000 else print("ABC")

Submission status: Accepted

Solution code:
n = int(input())
if 1 <= n <= 999:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
def ABC_99_A():
    N = int(input())
    if N < 1000:
        print('ABC')
    else:
        print('ABD')

if __name__ == '__main__':

    ABC_99_A()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    if N < 1000:
        ans = "ABC"
    else:
        ans = "ABD"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N=int(input())
print('ABC' if N<1000 else 'ABD')

Submission status: Accepted

Solution code:
N = int(input())
if N<1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    print('ABC' if n<=999 else 'ABD')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
print('ABC' if N < 1000 else 'ABD')

Submission status: Accepted

Solution code:
N = int(input())
if N < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
l = ["ABC","ABD"]
import math
n = int(input())
print(l[math.floor(n/1000)])

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LS(): return list(sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))

N = I()
if N >= 1000:
    print('ABD')
else:
    print('ABC')

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
from string import ascii_lowercase, ascii_uppercase, digits
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
N = ri()
print('ABC' if N < 1000 else 'ABD')

Submission status: Accepted

Solution code:
n=int(input())
if n<1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
n = input()
if len(n)==4:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
n = int(input())
if 1 <= n <= 999:
    print('ABC')
elif 1000 <= n <= 1998:
    print('ABD')

Submission status: Accepted

Solution code:

N = int(input())

print("ABC" if N < 1000 else "ABD")

Submission status: Accepted

Solution code:
n=int(input())
if n < 1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
print('ABC') if n > 0 and n < 1000 else print('ABD')

Submission status: Accepted

Solution code:
N = int(input())
if(N <= 999):
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
print("ABC" if int(input()) <= 999 else "ABD")

Submission status: Accepted

Solution code:

n = int(input())
if n > 999:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n=int(input())
if n<1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
if n > 999:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

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

N = int(input())

if N <= 999:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
print("ABC" if N<=999 else "ABD")

Submission status: Accepted

Solution code:
n=int(input())

if n < 1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
# coding: utf-8

# https://atcoder.jp/contests/abc099/tasks
# 15:00-


def main():
    n = int(input())
    if n < 1000:
        return "ABC"
    else:
        return "ABD"


print(main())

Submission status: Accepted

Solution code:
N = int(input())
if N<1000:
  print('ABC')
else :
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())

if (n<1000):
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
a=int(input())
if a<=999:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
if int(input())<1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
N = int(input())

print('ABD' if N >=1000 else 'ABC')

Submission status: Accepted

Solution code:
n = int(input())

if n <= 999:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop

import collections

n = int(input())
if n>=1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n = int(input())

if n < 1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n=int(input())
print('ABC'if n<=999 else 'ABD' )

Submission status: Accepted

Solution code:
N = int(input())
if N <= 999:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
N = int(input())
if(N>=1000):
    print('ABD')
else:
    print('ABC')

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

N = INT()
print("ABC" if N < 1000 else "ABD")

Submission status: Accepted

Solution code:
def resolve():
    n=int(input())
    if n>=1000:
        print('ABD')
    else:
        print('ABC')
resolve()

Submission status: Accepted

Solution code:
print('ABC' if int(input())<1000 else 'ABD')

Submission status: Accepted

Solution code:
a =int(input())
if a>999:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    N=int(input())
    if N>999:
        print('ABD')
    else:
        print('ABC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
if n > 999: print("ABD")
else: print("ABC")

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    if N > 999:
        print("ABD")
    else:
        print("ABC")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())

if N > 999:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    if N > 999:
        print('ABD')
    else:
        print('ABC')
main()

Submission status: Accepted

Solution code:
def main():
    X = int(input())
    return 'ABD' if X > 999 else 'ABC'

print(main())

Submission status: Accepted

Solution code:
n = int(input())
if n >= 1000:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
n = int(input())
if n<1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
n = len(input())

if n <= 3:
  print("ABC")
  
else:
  print("ABD")

Submission status: Accepted

Solution code:
a=int(input())

if a<1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N > 999:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
a = int(input())
print("ABC" if a<=999 else "ABD")

Submission status: Accepted

Solution code:
n = int(input())

print("ABC" if n<=999 else "ABD")

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()))

n = ni()

if n < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
if  n >= 1000:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
if int(input())>999:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n=int(input())
print("ABC" if n < 1000 else "ABD")

Submission status: Accepted

Solution code:
N = input()

if len(N)<=3:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
icase=0    
if icase==0:
    n=int(input())
    if n<=999:
        print("ABC")
    else:
        print("ABD")

Submission status: Accepted

Solution code:
n=int(input())
if(n>=1000):
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:

n = int(input())

if n <= 999:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N<1000:
    print("ABC")
elif N>=1000:
    print("ABD")

Submission status: Accepted

Solution code:
n=int(input())
x=n-999 if n>999 else n
if n>999:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
print(["ABC","ABD"][int(input())>=1000])

Submission status: Accepted

Solution code:
N=int(input())
if N<=999:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
nim = int(input())
if nim <=999:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
def resolve():
    N = int(input())
    if N >= 1000:
        print("ABD")
    else:
        print("ABC")

if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
def f(N):
    if N>999:
        return "ABD"
    else:
        return "ABC"
N=int(input())
print(f(N))

Submission status: Accepted

Solution code:
a = int(input())
if a <= 999:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
N=int(input())

def name(N):
    if 1<=N<=999:
        return 'ABC'
    else:
        return 'ABD'
        
print(name(N))

Submission status: Accepted

Solution code:
N = input()
if (int(N) <= 999):
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N <= 999:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N > 999:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n = int(input())

if n>=1000:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
n=int(input())
print('ABC' if n<=999 else 'ABD')