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:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

#A
def A():
    n = II()
    if n < 1000:
        print("ABC")
    else:
        print("ABD")
    return

#B
def B():
    return

#C
def C():
    n = II()
    dp = [inf for i in range(n + 1)]
    ans = [1]
    x = 6
    while x <= n:
        ans.append(x)
        x = x * 6
    x = 9
    while x <= n:
        ans.append(x)
        x = x * 9
    ans.sort()
    for i in ans:
        dp[i] = 1
    for i in range(1, n + 1):
        if not i in ans:
            a = bisect.bisect_left(ans, i)
            for k in range(a):
                #print(i,ans[k], a)
                dp[i] = min(dp[i - ans[k]] + 1, dp[i])
    print(dp[n])

    return

#D
def D():
    n, c = LI()
    D = LIR(c)
    C = LIR_(n)
    CL = list(itertools.permutations(range(c), 3))
    ans = inf
    amari0 = [0 for i in range(30)]
    amari1 = amari0[::1]
    amari2 = amari0[::1]
    for y in range(n):
        for x in range(n):
            amari = (x + y) % 3
            if amari == 0:
                amari0[C[y][x]] += 1
            if amari == 1:
                amari1[C[y][x]] += 1
            if amari == 2:
                amari2[C[y][x]] += 1
    for c0, c1, c2 in CL:
        ansb = 0
        for i in range(c):
            ansb += D[i][c0] * amari0[i]
            ansb += D[i][c1] * amari1[i]
            ansb += D[i][c2] * amari2[i]
        ans = min(ans, ansb)

            
    print(ans)

    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
print('AB'+chr(67+int(input())//1000))

Submission status: Accepted

Solution code:
N = int(input())

# print(N)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    N = int(input())
    if N>999:
        print('ABD')
    else:
        print('ABC')
        
if __name__ == '__main__':
    main()

Submission status: Accepted

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

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    n = int(input())

    print("ABC" if n <= 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("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, b = map(int,input().split())
#ls = list(map(int,input().split()))
r = int(input())
#s = input()

if r < 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:
print('AB%s'%chr(67+(len(input())>3)))

Submission status: Accepted

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

# input
N = int(input())

# solve
ans = 'ABC' if N < 1000 else 'ABD'

# output
print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import numpy as np
import statistics
from statistics import mean, median,variance,stdev
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
answer = int(input())
if answer >= 1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

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

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:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

N = n()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_line = int(input())

if input_line <= 999:
  print("ABC")
elif input_line <= 1998:
  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:
x=int(input())
if x<1000:
  print("ABC")
else:print("ABD")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
offset = 'ABC' if N <= 999 else 'ABD'
print(offset)# + str(N%999))

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

Submission status: Accepted

Solution code:
n = int(input())

if n <= 999 and n >= 1:
    print('ABC')

else :
    print('ABD')

Submission status: Accepted

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


abc()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
if 999 < int(N):
    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 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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("AABBCD"[int(input())>999::2])

Submission status: Accepted

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

Submission status: Accepted

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

n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

flg = "ABC"

if n >= 1000:
    flg = "ABD"
print(flg)

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

Submission status: Accepted

Solution code:
num = int(input())
if num<=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:
contest = ['ABC', 'ABD']
N = int(raw_input())
print contest[(N-1)/999]

Submission status: Accepted

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

Submission status: Accepted

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


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


# Generated by 1.1.4 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()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

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 1000 <= n:
    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:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_str(): return list(input().split())

N = int(input())

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n = f()[0]
    if n>=1000:
        print('ABD')
    else:
        print('ABC')

solve()

Submission status: Accepted

Solution code:
# ContestName
# URL
import sys
#import numpy as np

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

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
import sys


def solve(N: int):
    if N < 1000:
        ret = 'ABC'
    else:
        ret = 'ABD'
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


###############################################################################


def main():
    n = intin()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
under = "ABC"
over = "ABD"

if N > 1000:
#  tmp = str(N-1000)
  print(over)
elif N == 1000:
  print("ABD")
else:
#  tmp = str(N)
  print(under)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()
print("ABD") if len(s) > 3 else print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}
n = int(input())
if n<1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019/05/09
# AtCoder Beginner Contest 099 - A
 
# Input
n = int(input())

# Check
if n < 1000:
  ans = "ABC"
else:
  ans = "ABD"

# Output
print(ans)

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

Submission status: Accepted

Solution code:
n=int(input())
print('ABC') if n < 1000 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('AB' + chr(N // 1000 + 67))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def read_input():
    n = int(input())
    return n


def submit():
    n = read_input()

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

if __name__ == '__main__':
    submit()

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:
a=int(input())

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

Submission status: Accepted

Solution code:
print("AB"+["D","C"][int(input())<1000])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import numpy as np
import math
import re
import functools

n = int(input())

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

Submission status: Accepted

Solution code:
from collections import Counter
from functools import reduce
# import statistics
import bisect
import copy
import fractions
import math
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers):
    return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers):
    return reduce(LCM, numbers)
def LCM(m, n):
    return (m * n // fractions.gcd(m, n))

def unite(x, y):
    # それぞれのノードの根を求める
    x = root(x)
    y = root(y)
    if x == y:
        return
    # node[x]の根をyに変更する
    node[x] = y
def same(x,y): return bool(root(x) == root(y))
def root(x):
    if node[x] == x:  # xが根の場合
        return x
    else:
        node[x] = root(node[x])  # 経路圧縮
        return node[x]

print('ABC') if II() <= 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())

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:
#import math
#import sys

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:
#!/usr/bin/env python3
import numpy as np
import math
import re
import functools

n = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np

readInt = lambda: int(sys.stdin.readline())
readIntN = lambda: [int(v) for v in sys.stdin.readline().split(' ')]

n = readInt()
ret = 'AB' + ('C' if n < 1000 else 'D')
print(ret)

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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

    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = input()

print('ABD' if int(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:
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:
print("ABD" if len(input()) > 3 else "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 permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits


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


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:
a = int(input())
if a >= 1 and a <= 999 :
    print('ABC')
elif a >= 1000 :
    print('ABD')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

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

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

Submission status: Accepted

Solution code:
n=int(input())
if 0<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:
#!/usr/bin/python

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = str(input())
if int(N) >= 1 and int(N) <= 999:
    print("ABC")
elif int(N) >= 1000 and int(N) <= 1998:
    print("ABD")

Submission status: Accepted

Solution code:
print(["ABC", "ABD"][not(int(input())<1000)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i=int(input())
if i>999:
  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:
a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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