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())
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 <= 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:
n=int(input())
if(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("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

if N >= 1999: # 不等号は=の手前に
    print('The contest has not been held')

elif N < 1000:
    print('ABC')

elif N >= 1000:
    print('ABD')

Submission status: Accepted

Solution code:
N = contest_numer =int(input())
if contest_numer > 999 and 1998 >= contest_numer:
    print("ABD")

elif contest_numer > 0 and 999 >= contest_numer:
    print("ABC")

else:
    print("contest that you inputted now has not been held")

Submission status: Accepted

Solution code:
integer = int(input())

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

Submission status: Accepted

Solution code:
number = int( input() )

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

Submission status: Accepted

Solution code:
#AtCoder_abc099_a

#入力する整数を入力
N = int(input())

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

Submission status: Accepted

Solution code:
#AtCoder Beginner Contestが始まってから早数十年。コンテストは 1 回目から順に ABC001,ABC002, と名付けられてきましたが、
#999 回目のコンテスト ABC999 を終え、これからのコンテストの名前をどうするかという問題が生じました。
#そこで、1000 回目から 1998 回目のコンテストを順に ABD001,ABD002,...,ABD999 と名付けることとなりました。1 以上1998 以下の整数
#N が与えられるので、N 回目のコンテストの名前の最初の3文字を出力してください。

N = int(input())

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

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

if 999 >= N >= 1:
    print("ABC")
if 1998 >= N >= 1000:
    print("ABD")

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
# A - ABD

# 1～999までは"ABC"、1000～1998までは"ABD"で始まるコンテスト名を返す


N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
# A - ABD
# https://atcoder.jp/contests/abc099/tasks/abc099_a

N = int(input())

result = 'ABC'

if 1000 <= N <= 1998:
    result = 'ABD'

print(result)

Submission status: Accepted

Solution code:

n=input()


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

elif N <= 1998:
    print('ABD')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()
N=int(N)
if N<1000:
    print('ABC')
elif N>=1000:
    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 <= 999:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())

if num < 1000:
    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:
N=int(input())

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

Submission status: Accepted

Solution code:
N=input()

if int(N) >= 1000:
    print('ABD')


else:
    print('ABC')

Submission status: Accepted

Solution code:
N = input()

if int(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")
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("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
N = int(input())

if (1 <= N <= 1998):
    if 1 <= N <= 999:
        print('ABC')
    elif 1000 <= N <= 1998:
        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 >= 1000:
    print( 'ABD' )

else :
    print( 'ABC' )

Submission status: Accepted

Solution code:
N = int(input())

if N < 1000:
    print('ABC')
elif N <= 1998:
    print('ABD')
else:
    print('間違っています')

Submission status: Accepted

Solution code:
# abc099_a
# Nは整数
# N回目のコンテストの名前の最初の3文字を出力

N = int(input())

if 1 <= 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:
if int(input()) // (999 + 1) == 0:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
N = int(input())

if N < 1000:
    print('ABC')

elif 1000 <= N <= 1998:
    print('ABD')

Submission status: Accepted

Solution code:
#   AtCoder abc099 a

#   入力
n = int(input())

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

Submission status: Accepted

Solution code:
contest_num = int(input())

if contest_num >= 1999: # 不等号は=の手前に
    result_str = 'The contest has not been held'

elif contest_num < 1000:
    result_str = 'ABC'

elif contest_num >= 1000:
    result_str = 'ABD'

print(result_str)

Submission status: Accepted

Solution code:
# 1回目から順に ABC001,ABC002...
# 1000 回目から 1998回目のコンテストを順に ABD001,ABD002...
# 1以上 1998以下の整数 N が与えられるので、
# N回目のコンテストの名前の最初の 3 文字を出力

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:
# 099a
# A - ABD

N = int(input())

if 1 <= N & N <= 999:
    print('ABC')
elif 1000 <= N & N <= 1998:
    print('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()) <= 999:
	print('ABC')
else:
	print('ABD')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 099a https://atcoder.jp/contests/abc099/tasks/abc099_a

# 入力
N = int(input()) # Nはコンテスト開催数　N回目

# 処理
if N < 1 or N > 1998:
    answer = '値が制約外です'
elif N <= 999:
    answer = 'ABC'
else:
    answer = 'ABD'

# 出力
print(answer)

Submission status: Accepted

Solution code:
# 大会の回数を取得
N = int(input())

if N < 1000:
    Contest = "ABC"
    print(Contest)
elif N >= 1000:
    Contest = "ABD"
    print(Contest)

Submission status: Accepted

Solution code:
S: str = input()
print_list = ['C', 'D']
value = 1000 - int(S)
if value > 0:
    print("AB" + print_list[0])
else:
    print("AB" + print_list[1])

Submission status: Accepted

Solution code:
# コンテストは
# 1 回目から順に ABC001,ABC002,... と名付けられてきましたが、
# 999回目のコンテスト ABC999 を終え、これからのコンテストの名前をどうするかという問題が生じました。
# そこで、1000回目から1998回目のコンテストを順に ABD001,ABD002,...,ABD999 と名付けることとなりました。
#
# 1 以上 1998 以下の整数 N が与えられるので、
# N 回目のコンテストの名前の最初の 3 文字を出力してください。

# 標準入力から コンテストの回数 N を取得する
input_n = int(input())

# 取得した N を頼りに、最初の3文字（AB*）を出力する
reslut_str = 'ABC'
if input_n > 1999:
    result_str = 'The contest has not been held'
else:
    if input_n < 1000:
        reslut_str = 'ABC'
    elif input_n >= 1000:
        reslut_str = 'ABD'

print(reslut_str)

Submission status: Accepted

Solution code:
# 何回目の大会かを入力
taikai_num = int(input())
# 999回目まではABCを出力、それ以降はABDを出力
if taikai_num <= 999:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
# 099A
# N回目のコンテスト
# 999回まで ABC、1000回目から1998回目 ABD

# 入力
n = int(input())

# 処理
if n < 1000:
    print("ABC")
elif n >= 1000:
    print("ABD")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

if 1 <= N <= 999:
    print('ABC')
elif 1000 <= N <= 1998:
    print('ABD')
else:
    print('1以上 1998以下 の値を入力してください')

Submission status: Accepted

Solution code:
#A-ABD 099
#1以上 1998 以下の整数 N
# N 回目のコンテストの名前の最初の 3 文字出力してください。

N =int(input(''))
if  1<=N and N<=999:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
# 099a

N = int(input())    # N回目のコンテスト

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

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 >= 1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力
N = int(input(''))

# もしNが999以下ならABC、1000以上ならABD
if N <= 999:
    print('ABC')
elif N >= 1000:
    print('ABD')
else:
    print('Error')

Submission status: Accepted

Solution code:
N = int(input())

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

# strとintが混ざるとエラーになる
# Nは回数だから、intで整数にする

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")
    # print("ABD" + str(n - 999).zfill(3))
if n <= 999:
    print("ABC")
    # print("ABC" + str(n))

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 >= 1000 else '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())
# 999回目以下なら ABC
if n<=999:
    print('ABC')
# そうでないなら ABD を出力する
else:
    print('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 999>=N>=1:
     print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
N = int(input())

if 999>=N>=1:
    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:
# A - ABD
# コンテスト名が開催数によって変化する
# 1~999 回目 ABC001 ABC002 ... ABC999
# 1000 ~ 1998 回目 ABD001 ABD002 ... ABD999
# 最初の3文字を出力させる

# 開催数 N (整数） の入力
N = int(input())
# print(N)

# 条件分岐　N が 1 ~ 999 の時 ABC
if N <= 999:
    answer = 'ABC'
elif N <= 1998:
    answer = 'ABD'

# 結果の表示
print(answer)

Submission status: Accepted

Solution code:
# 099A

N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

if 1 <= N <= 999:
    print('ABC')

else:
    print('ABD')

Submission status: Accepted

Solution code:
contest_num = int(input())

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

Submission status: Accepted

Solution code:
name = int(input())

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

Submission status: Accepted

Solution code:

# 入力
N = int(input())

# 処理&出力
if N < 1000:
    print('ABC')
elif 1000 <= N <= 1998:
    print('ABD')
else:
    print('IDK')

Submission status: Accepted

Solution code:

# 入力
N = int(input())

# 処理&出力
if N < 1000:
    print('ABC')
elif 1000 <= N <= 1998:
    print('ABD')

Submission status: Accepted

Solution code:
N=int(input())
if 1<=N and 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())
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:
    ans="ABC"
else:
    ans="ABD"
print(ans)

Submission status: Accepted

Solution code:
print('ABC' if int(input()) < 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())
if n >= 1000:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print(["ABD","ABC"][len(input())<4])

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

Submission status: Accepted

Solution code:
N = int(input())


def main():
    ans = "ABC" if N < 1000 else "ABD"
    print(ans)


if __name__ == "__main__":
    main()

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)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]

n = int(input())

if (n>=1000):
    print("ABD")
else:
    print("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():
    N = int(readline())

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
print('AB'+'CD'[int(input())>999])

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

Submission status: Accepted

Solution code:
if int(input()) >= 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:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = int(readline())
    contest = N // 1000
    if contest >= 1:
        print('ABD')
    else:
        print('ABC')


if __name__ == '__main__':
    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())
print("ABC" if N < 1000 else "ABD")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=int(input())
if s<=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())
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')
else:
  print('ABD')

Submission status: Accepted

Solution code:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
from fractions  import gcd
#input=sys.stdin.readline
#import bisect
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:
s=int(input())
if s>999:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
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
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
import numpy as np
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()
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:
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():
    N = I()

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
print("AB", end="")
print("C") if int(input()) < 1000 else print("D")

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    if n < 1000:
        print('ABC')
    else:
        print('ABD')
        
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:
import sys
def I(): return int(sys.stdin.readline().rstrip())

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

Submission status: Accepted

Solution code:
print("AB"+"CD"[int(input())>999])

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
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
cnt = 0
ans = 0
inf = float("inf")

x = k()
if x <= 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 < 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:
import math
n  = int(input())
print('AB'+chr(ord('C')+math.ceil(n/999)-1))

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:
print(["ABC","ABD"][1000<=int(input())])

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

Submission status: Accepted

Solution code:
print('ABD' if 999 < int(input()) else '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!=1 else print("ABD")

Submission status: Accepted

Solution code:
# A - ABD
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

n = int(readline())
print('ABC' if n <= 999 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 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())
if 1000<=N:
    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:
a = int(input())
if a<1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    N -= 1
    N //= 999
    s = ord('C') + N
    print('AB' + chr(s))


if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('ABD' if int(input())//1000 else '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
n = int(input())
if n > 999:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

print('ABD' if ri() > 999 else 'ABC')

Submission status: Accepted

Solution code:
import sys
N = int(input())

if not ( 1 <= N <= 1998 ):
    sys.exit()

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

Submission status: Accepted

Solution code:
print('DC'[len(input('AB'))<4])

Submission status: Accepted

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

Submission status: Accepted

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

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 < 1000:
	print("ABC")
else:
	print("ABD")

Submission status: Accepted

Solution code:
print('ABC'if len(input())<4else'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:
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")