Problem:
 Score : 100 points    Problem Statement This contest, AtCoder Beginner Contest , is abbreviated as ABC .  When we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.  What is the abbreviation for the N -th round of ABC? Write a program to output the answer.      Constraints  100 ≤ N ≤ 999         Input Input is given from Standard Input in the following format:  N       Output Print the abbreviation for the N -th round of ABC.        Sample Input 1 100      Sample Output 1 ABC100  The 100th round of ABC is ABC100.       Sample Input 2 425      Sample Output 2 ABC425       Sample Input 3 999      Sample Output 3 ABC999

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007


n = input()
print("ABC"+n)



"""
def dijkstra():
    d[0] = 0
    q = [[0,0]]
    while q:
        dx, x = heappop(q)
        for y in v[x]:
            if d[y] > dx+1:
                d[y] = dx+1
                heappush(q,[d[y],y])
n,m = LI()
v = [[] for i in range(n)]
for i in range(m):
    a,b = LI()
    a -= 1
    b -= 1
    v[a].append(b)
    v[b].append(a)
d = [float("inf") for i in range(n)]
dijkstra()
if d[n-1] <= 2:
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")
"""


"""
k = I()
ans = [i+k//50 for i in range(50)]
k %= 50
for i in range(k):
    ans[i] += 51
    for j in range(50):
        ans[j] -= 1
print(50)
print(*ans)
"""

Solution (Python):
n = input()
print("ABC" + n)

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC" + input())

Solution (Python):
a=input()
print("ABC"+a)

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
n = input()
print("ABC{}".format((3-len(n))*"0"+n))

Solution (Python):
print("ABC"+input())

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
print "ABC" + raw_input()

Solution (Python):
print("ABC"+input())

Solution (Python):
n=input()
str="ABC"
str+=n
print(str)

Solution (Python):

print("ABC"+input())

Solution (Python):
print('ABC'+str(input()))

Solution (Python):
N=input()
print("ABC{}".format(N))

Solution (Python):
N=input()
print("ABC{}".format(N))

Solution (Python):
N=input()
print("ABC{}".format(N))

Solution (Python):
N=input()
print("ABC{}".format(N))

Solution (Python):
N=input()
print("ABC{}".format(N))

Solution (Python):
N=input()
print("ABC{}".format(N))

Solution (Python):
print('ABC' + input())

Solution (Python):



def main():
    n = input()
    print('ABC' + n)


if __name__ == '__main__':
    main()

Solution (Python):
def func(n):
    return 'ABC' + N

N = input()

print(func(N))

Solution (Python):
n = raw_input()
print "ABC" + n

Solution (Python):
print('ABC' + input())

Solution (Python):
N = str(input())
print("ABC" + N)

Solution (Python):
N = int(input())
print("ABC"+str(N))

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
print("ABC"+str(input()))

Solution (Python):
N = input()
print('ABC' + '0'*(3 - len(N)) + N)

Solution (Python):
print("ABC"+input())

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
N = input()
print('ABC'+N)

Solution (Python):
N = input()
print("ABC"+str(N))

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
a = input()
print("ABC"+a)

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
def main():
    print("ABC" + input())


if __name__ == "__main__":
    main()

Solution (Python):
print("ABC" + input())

Solution (Python):
N = input()
print('ABC' +  N)

Solution (Python):
print("ABC"+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
a=input()
print("ABC"+a)

Solution (Python):

print("ABC"+input())

Solution (Python):
N = input()
print('ABC' + N)

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
from sys import stdin
n = stdin.readline().rstrip()
print('ABC'+n)

Solution (Python):
print("ABC"+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
n=input()
s='ABC'+str(n)
print(s)

Solution (Python):
N=str(input())
print('ABC'+N)

Solution (Python):
print('ABC'+input())

Solution (Python):
n = input()
print("ABC" + n)

Solution (Python):
s = input()
print('ABC'+s)

Solution (Python):
print('ABC'+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC{}".format(int(input())))

Solution (Python):
s=input();print("ABC"+s)

Solution (Python):
print("ABC" + str(input()))

Solution (Python):
print(input('ABC'))

Solution (Python):
print('ABC' + input())

Solution (Python):
n = int(input())
print("ABC"+str(n))

Solution (Python):
n = input()
print("ABC"+n)

Solution (Python):
N = int(input())

ans = "ABC{}".format(N)

print(ans)
print()

Solution (Python):
N = input()
print('ABC'+N)

Solution (Python):
n = input()

print("ABC"+n)

Solution (Python):
print('ABC' + input().zfill(3))

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
print "ABC"+raw_input()

Solution (Python):
s=input()
print("ABC"+s)

Solution (Python):
N = input()
print('ABC'+ N)

Solution (Python):
s = str(input())
print("ABC"+s)

Solution (Python):
N = input()
ans = "ABC" + N
print(ans)

Solution (Python):
print("ABC" + input())

Solution (Python):
print("ABC"+input())

Solution (Python):
a=input()
print("ABC"+a)

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
N = input()
print("ABC" + N)

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
a=input()
print("ABC",end="")
print(a,end="")

Solution (Python):
n = input()
ans = "ABC"+n
print(ans)

Solution (Python):
n = input()
print('ABC'+n)

Solution (Python):
int_n = int(input())

print("ABC{0:03d}".format(int_n))

Solution (Python):
N = str(input())
print("ABC" + N)

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
S = input()

ans = "ABC" + S
print(ans)

Solution (Python):
n=input()
print("ABC",end='')
print(n)

Solution (Python):
print('ABC'+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC{}".format(int(input())))

Solution (Python):
n = input()
print("ABC"+n)

Solution (Python):
n = int(input())
print('ABC{:03}'.format(n))

Solution (Python):

def getInt(): return int(input())
N = input()
print('ABC' + N)

Solution (Python):
n = input()
print('ABC'+n)

Solution (Python):
n = input()
print("ABC" + n)

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC' + input())

Solution (Python):
print('ABC%03d' % int(input()))

Solution (Python):




N = int(input())
print("ABC"+"{:03d}".format(N))

Solution (Python):
a = input()
S="ABC"+a
print(S)

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print ('ABC'+input())

Solution (Python):
n = str(input())
print('ABC'+n)

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
n=input()
print('ABC'+n)

Solution (Python):
print('ABC' + input())

Solution (Python):
print('ABC'+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC" + input())

Solution (Python):
c = str(input())
print("ABC"+c)

Solution (Python):
N = input()
print("ABC" + N)

Solution (Python):
a =input()
b ="ABC"+a
print(b)

Solution (Python):
print("ABC" + input())

Solution (Python):
a = input()

print("ABC"+a)

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
def abc068_a():
    n = input()
    print("ABC" + n)


abc068_a()

Solution (Python):
num = input()
print("ABC" + num)

Solution (Python):



def main():
    n = input()
    print('ABC' + n)


if __name__ == '__main__':
    main()

Solution (Python):
print("ABC{}".format(input()))

Solution (Python):
N=input()
print("ABC"+N)

Solution (Python):
N = input()
print('ABC' + N)

Solution (Python):
N = int(input())
print("ABC"+str(N))

Solution (Python):
N = input()

print("ABC" + N)

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
def main():
    print('ABC' + input())


if __name__ == '__main__':
    main()

Solution (Python):
n = input()
print("ABC" + n)

Solution (Python):
print("ABC"+input())

Solution (Python):
n = input()
print("ABC" + n)

Solution (Python):
N = int(input())
print("ABC%03d" % N)

Solution (Python):
n=str(input())

print("ABC"+n)

Solution (Python):

N = str(input())
print("{}".format("ABC" + N))

Solution (Python):
print("ABC"+input())

Solution (Python):



def main():
    """Function."""
    n = str(input())
    print("ABC" + n)


if __name__ == "__main__":
    main()

Solution (Python):
a=input()
print("ABC" + a)

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
N=input()
print('ABC'+N)

Solution (Python):
print("ABC" + input())

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
print('ABC'+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
n = input()
print("ABC" + n)

Solution (Python):
s = input()
print("ABC", s, sep="")

Solution (Python):
n = input()
print('ABC'+n)

Solution (Python):
n = input()
abc = 'ABC'
print(abc + n)

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
a = input()
print("ABC"+a)

Solution (Python):
N=input()

print("ABC"+N)

Solution (Python):
print('ABC' + input())

Solution (Python):
n = input()
print("ABC"+n)

Solution (Python):
n = int(input().strip())
print("ABC" + "{:0>3}".format(str(n)))

Solution (Python):
N = input().rstrip()
print('ABC{0:3s}'.format(N))

Solution (Python):
N = int(input())

print('ABC%03d' % N)

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
a = input()
print("ABC" + a)

Solution (Python):
a = 'ABC'
b = input()
print(a+b)

Solution (Python):
N = input()
print("ABC" + N)

Solution (Python):
print("ABC{}".format(int(input())))

Solution (Python):
print("ABC" + input())

Solution (Python):
N = raw_input()
print "ABC%s" % (N)

Solution (Python):
N = input()
print('ABC%s' % N)

Solution (Python):
print("ABC{:03}".format(int(input())))

Solution (Python):
N = str(input())
print('ABC'+N)

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
a = input()
print('ABC'+ a)

Solution (Python):
print("ABC{0}".format(input()))

Solution (Python):
N = int(input())
if N < 100:
    ans = 'ABC' + '0' + str(N)
else:
    ans = 'ABC' + str(N)
print(ans)

Solution (Python):
print('ABC'+input())

Solution (Python):
a = input()
print("ABC"+a)

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
print('ABC'+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
n=input()
print('ABC'+n)

Solution (Python):
print("ABC"+input())

Solution (Python):
a=(str)(input())
print("ABC"+a,"\n")

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
N = input()
print("ABC" + N)

Solution (Python):
print("ABC" + input())

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
print("ABC"+str(input()))

Solution (Python):
print("ABC" + input())

Solution (Python):
print("ABC" + input())

Solution (Python):
N = input()

print("ABC" + N)

Solution (Python):

print("ABC" + input())

Solution (Python):
n = int(input())
print("ABC"+str(n))

Solution (Python):
print("ABC" + input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
l = input()
print('ABC'+l)

Solution (Python):


n  = int(input())
print("ABC%d"%(n))

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
n = input()

print("ABC" + str(n))

Solution (Python):
print('ABC' + input())

Solution (Python):
n = str(input())
print("ABC"+n)

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
n = input()
s = '000' + n
ans = 'ABC' + s[len(s)-3:]
print(ans)

Solution (Python):
print("ABC" + input())

Solution (Python):
print("ABC"+input())

Solution (Python):
def main():
    N = input()
    S = "ABC"
    print(S + N)
if __name__ == "__main__":
    main()

Solution (Python):
def main():
    n = input()
    s = "ABC"
    print(s + n)
    
if __name__ == "__main__":
    main()

Solution (Python):
def main():
    n = input()
    
    s = "ABC"
    print(s + n)
    
if __name__ == "__main__":
    main()

Solution (Python):

def main():
    N = input()
    print("ABC" + N)
if __name__ == "__main__":
    main()

Solution (Python):
def main():
    N = input()
    print("ABC"+N)

if __name__ == "__main__":
    main()

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC' + input())

Solution (Python):
print('ABC' + input())

Solution (Python):
N = input()
print('ABC'+N)

Solution (Python):
N = input()
print("ABC" + N)

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    N = input()
    print("ABC" + N)


if __name__ == '__main__':
    main()

Solution (Python):
N=input()
print('ABC'+N)

Solution (Python):
print("ABC{}".format(input()))

Solution (Python):
a = int(input()) 

print("ABC", a, sep='')

Solution (Python):
N = input()
print('ABC' + N)

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
N=input()
print("ABC"+N)

Solution (Python):
S = input()

print("ABC" + S)

Solution (Python):
N = input()

print('ABC' + N)

Solution (Python):
n = input()
print("ABC{}".format(n))

Solution (Python):
n = input()

print('ABC'+n)

Solution (Python):
x=input()
print("ABC"+x)

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
n = str(input())
print('ABC'+n)

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return




dp = None


def main():
    print("ABC" + input())


main()

Solution (Python):
print("ABC"+input())

Solution (Python):
N = input()
print('ABC' + N)

Solution (Python):
N=int(input())
print("ABC"+str(N))

Solution (Python):
N=input()
S='ABC'
print(S+N)

Solution (Python):
print("ABC"+input())

Solution (Python):
s=input()
print("ABC"+s)

Solution (Python):

s = input()
result = "ABC" + s
print(result)

Solution (Python):

s = input()
result = "ABC" + s
print(result)

Solution (Python):
print("ABC" + input())

Solution (Python):
s = input()
result = "ABC" + s
print(result)

Solution (Python):
print("ABC" + input())

Solution (Python):

n=input()
print('ABC'+ n )

Solution (Python):
print("ABC"+input())

Solution (Python):
N = int(input())
print("ABC{}".format(N))

Solution (Python):
s = raw_input()
print('ABC%s' % s)

Solution (Python):
print 'ABC' + raw_input()

Solution (Python):
N = input()
S = "".join(["ABC",N])
print(S)

Solution (Python):
print 'ABC' + raw_input()

Solution (Python):
print 'ABC' + raw_input()

Solution (Python):
print("ABC{}".format(input()))

Solution (Python):
N = input()
print('ABC'+N)

Solution (Python):
print('ABC'+input())

Solution (Python):


def main():
    n = int(input())
    print('ABC{:03d}'.format(n))


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
print("ABC" + s)

Solution (Python):
n = input()
print('ABC'+n)

Solution (Python):
print("ABC" + input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
N = int(input())
print('ABC'+str(N))

Solution (Python):
print('ABC'+str(input()))

Solution (Python):
n_str = input()

print("ABC" + n_str)

Solution (Python):
print("ABC" + input())

Solution (Python):
print("ABC" + input())

Solution (Python):
print('ABC'+str(input()))

Solution (Python):
N = int(input())

print("ABC" + str(N))

Solution (Python):
print("ABC" + input())

Solution (Python):
n = input()
print("ABC" + n)

Solution (Python):
print("ABC"+ input())

Solution (Python):
print('ABC' + input())

Solution (Python):
print('ABC'+input())

Solution (Python):

n=input()
n="ABC"+n
print(n)

Solution (Python):
print "ABC" + raw_input()

Solution (Python):
N = input()
print("ABC" + N)

Solution (Python):
S=input()

print("ABC"+S)

Solution (Python):
print("ABC"+input())

Solution (Python):
a=input()

print('ABC'+a)

Solution (Python):
a = input()
 
print("ABC" + a)

Solution (Python):
a = input()

print("ABC" + a)

Solution (Python):
S = input()
print("ABC"+S)

Solution (Python):
n = input()
print("ABC"+n)

Solution (Python):
print('ABC'+input())

Solution (Python):
print("ABC"+str(input()))

Solution (Python):


N = input()

print("ABC" + N)

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

n = ns()
print("ABC" + n)

Solution (Python):

N = input()

print('ABC' + N)

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
N=int(raw_input())
print 'ABC%03d' % N

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
N = input()
print('ABC'+N)

Solution (Python):


print('ABC'+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
S=input()
print("ABC"+S)

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC{}'.format(input()))

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
N = input()

print("ABC" + N)

Solution (Python):
print('ABC' + input())

Solution (Python):
n = int(input())
print('ABC' + '{0:03d}'.format(n))

Solution (Python):
N = int(input())
if N < 10:
    print("ABC00{}".format(N))
elif 10<=  N < 100:
    print("ABC0{}".format(N))     
else:
    print("ABC{}".format(N))

Solution (Python):
print("ABC"+input().strip())

Solution (Python):
print("ABC"+input())

Solution (Python):
ina = int(input())
print("ABC"+'{0:03d}'.format(ina))

Solution (Python):
print('ABC'+input())

Solution (Python):
N = input()
print('ABC' + N)

Solution (Python):
i = int(input())
print("ABC"+str(i))

Solution (Python):


n = int(input())

print("ABC"+str(n))

Solution (Python):
s = int(input());print('ABC{:03}'.format(s))

Solution (Python):
print("ABC"+input())

Solution (Python):
print('ABC' + input())

Solution (Python):
n = input()
print("ABC"+n)

Solution (Python):
n = int(input())
print('ABC'+str(n))

Solution (Python):
N=input()
print("ABC"+N)

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
print("ABC" + input())

Solution (Python):
N=int(input())
print('ABC'+str(N))

Solution (Python):
print('ABC'+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
a = input()
print('ABC'+a)

Solution (Python):
print('ABC' + input())

Solution (Python):
N = str(input())
print("ABC"+N)

Solution (Python):
s = input()
t = str(s)
u = 'ABC' + t
print(u)

Solution (Python):
print('ABC' + input())

Solution (Python):
n = int(input())

print("ABC" + str(n))

Solution (Python):
print('ABC'+input())

Solution (Python):
print('ABC' + input())

Solution (Python):
n = input()
print('ABC' + n)

Solution (Python):
print('ABC' + input())

Solution (Python):
print("ABC" + input())

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
N=(input())
print("ABC"+N)

Solution (Python):
print("ABC" + input())

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

n = arr_data[0][0]

print("ABC"+n)

Solution (Python):
n = input()
print("ABC"+n)

Solution (Python):
print("ABC"+input())

Solution (Python):





if __name__ == '__main__':
    number = input()
    print('ABC' + number)

Solution (Python):
a=input()
print("ABC"+a)

Solution (Python):
N = input()
print('ABC'+N)

Solution (Python):
print('ABC' + input())

Solution (Python):
print('ABC' + input())

Solution (Python):
s = input()
print('ABC'+s)

Solution (Python):
n = input()
print("ABC"+n)

Solution (Python):
n = input()
s = 'ABC' + n
print(s)

Solution (Python):
n=input()
print("ABC",end="")
print(n)

Solution (Python):
print('ABC'+input())

Solution (Python):
n = input()
print('ABC' + n)

Solution (Python):
n = input()
ans = 'ABC'
print(ans+n)

Solution (Python):


a = int(raw_input())

print("ABC"+str(a))

Solution (Python):
n=input()
print("ABC"+n[0:])

Solution (Python):
N = input()
print('ABC{}'.format(N))

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
N=input()
print("ABC"+N)

Solution (Python):
print("ABC"+input())

Solution (Python):
s = input()
print("ABC" + s)

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
n=input()
a=['ABC']
a.append(n)
out=''.join(a)
print(out)

Solution (Python):
print("ABC{0}".format(input()))

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print('ABC%03d' % int(input()))

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):

a = input()
ans = "ABC"+a

print(ans)

Solution (Python):
n = int(input())
print('ABC' + ('000' + str(n))[-3:])

Solution (Python):
n = input()
print('ABC'+n)

Solution (Python):
print("ABC" + input())

Solution (Python):
print("ABC"+input())

Solution (Python):
N=input();print('ABC'+N)

Solution (Python):
print('ABC'+input())

Solution (Python):
n = input()

print("ABC"+n)

Solution (Python):
a = input()
print("ABC"+a)

Solution (Python):
print("ABC" + input())

Solution (Python):
n = input()
print('ABC' + n)

Solution (Python):
print('ABC' + input())

Solution (Python):
print("ABC" + input())

Solution (Python):
a = input()
print("ABC"+a)

Solution (Python):
xxx = input()

print('ABC{0} ' .format(xxx))

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
print("ABC" + input())

Solution (Python):
n = raw_input()
print 'ABC' + (3 - len(n)) * '0' + n

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC" + input())

Solution (Python):
s = input()

print("ABC" + str(s))

Solution (Python):
N = input()
x = str('ABC' + str(N))
print(x)

Solution (Python):
n=input()
print("ABC"+n)

Solution (Python):
print("ABC" + input())

Solution (Python):
print "ABC%03d" % int(raw_input())

Solution (Python):
a = input()
ans = "ABC" + str(a)
print ans

Solution (Python):
print('ABC' + input())

Solution (Python):
print("ABC"+ input())

Solution (Python):
print("ABC" + input())

Solution (Python):
N = int(input())
print("ABC{0:03d}".format(N))

Solution (Python):


N = int(input())

print('ABC%03d' % N)

Solution (Python):
print('ABC'+input())

Solution (Python):

"""
http://abc068.contest.atcoder.jp/tasks/abc068_a

"""


def main():
    N = input()
    print('ABC' + N)


if __name__ == '__main__':
    main()

Solution (Python):
print("ABC"+input())

Solution (Python):
from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10


def main():
    N = input()
    print("ABC" + N)


if __name__ == '__main__':
    main()

Solution (Python):
N = input()
print('ABC' + N)

Solution (Python):
n=input()
print('ABC'+n)

Solution (Python):
N = input()
print('ABC'+N)

Solution (Python):
i=input()
print('ABC'+i)

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
print('ABC'+input())

Solution (Python):
n = int(input())
print("ABC",n,sep = '')

Solution (Python):
n=str(input())
print("ABC"+n)

Solution (Python):
n = input()
print("ABC" + n)

Solution (Python):
print('ABC' + input())

Solution (Python):
x = input()
print('ABC'+x)

Solution (Python):
S = input()
print('ABC' + S)

Solution (Python):
a=input()
b='ABC'
print(b + a)

Solution (Python):
def main():
    print("ABC{}".format(input()))
    

if __name__ == "__main__":
    main()

Solution (Python):
x=input()
print("ABC"+str(x))

Solution (Python):
N = int(input())

print("ABC" + str(N))

Solution (Python):
print("ABC"+str(input()))

Solution (Python):
N = input()
print("ABC{0}" .format(N))

Solution (Python):
N = raw_input()

print "ABC" + N

Solution (Python):












































a = input()
print("ABC"+str(a))

Solution (Python):
def main():
    print("ABC" + input())

if __name__ == '__main__':
    main()

Solution (Python):
N = input()
print('ABC' + N)

Solution (Python):
print("ABC" + input())

Solution (Python):
print('ABC'+input())

Solution (Python):



























































print('ABC'+input())

Solution (Python):
print("ABC" + input())

Solution (Python):
a=input()
print('ABC'+a)

Solution (Python):
print("ABC"+input())

Solution (Python):
print('ABC'+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
S = input()
print("ABC"+S)

Solution (Python):
print("ABC"+input())

Solution (Python):
N = input()
print("ABC" + N)

Solution (Python):
N = input()
print("ABC" + N)

Solution (Python):
n = input()
print("ABC" +n)

Solution (Python):
x=input()
print("ABC"+x)

Solution (Python):
N = input()

print("ABC" + N, sep=" ")

Solution (Python):


N = int(raw_input())
print 'ABC'+str(N)

Solution (Python):
n = input()
print("ABC" + n)

Solution (Python):
print("ABC{0}".format(input()))

Solution (Python):
n = int(input())
print("ABC" + str(n))

Solution (Python):
N = input()
print("ABC"+N)

Solution (Python):
a = raw_input()
print('ABC'+a)

Solution (Python):
print('ABC',int(input()),sep='')

Solution (Python):


import math

n = input()
print("ABC" + n)

Solution (Python):
print 'ABC'+raw_input()

Solution (Python):
x=input("")
print("ABC{}".format(x))

Solution (Python):
print('ABC'+input())

Solution (Python):


count = input()

print("ABC" + str(count))

Solution (Python):
print "ABC%d" % input()

Solution (Python):
print("ABC"+str(int(input())))

Solution (Python):
print('ABC'+input())

Solution (Python):
print str("ABC") + raw_input()

Solution (Python):
n=int(raw_input())
print "ABC"+str(n)

Solution (Python):
print("ABC"+input())

Solution (Python):
print("ABC"+input())

Solution (Python):
print('ABC' + input())

Solution (Python):


print('ABC' + input())

Solution (Python):
a=input()
print("ABC" + a)

Solution (Python):
a = input();
print ("ABC" + a)

Solution (Python):
a = int(input())
b = "ABC" + str(a)

print(b)

Solution (Python):




num = raw_input()

print "ABC"+num

Solution (Python):
s = input()
s = int(s)
print("ABC{0}".format(s))

Solution (Python):
a = input()
print ("ABC" + a)

Solution (Python):
s=input()
print("ABC%s"%(s))

Solution (Python):
num = input()
print("ABC" + num)

Solution (Python):


N = input()
print("ABC" + N)

Solution (Python):
n = input()
print('ABC' + n)

Solution (Python):
print('ABC' + input())

Solution (Python):
N = int(input())
print("ABC" + str(N))

Solution (Python):



import sys

n = sys.stdin.readline()

print ('ABC' + n)

Solution (Python):
print("ABC"+str(input()))

Solution (Python):
s = input()

print("ABC" + s)

Solution (Python):


 
a = input()
print ("ABC" + a )

Solution (Python):
print 'ABC' + raw_input()

Solution (Python):
a=input()
print("ABC"+a)

Solution (Python):
print("ABC"+input())

Solution (Python):
N = input()
print("ABC" + N)

Solution (Python):
N = raw_input()
print 'ABC{}'.format(N)

Solution (Python):
n = int(input())
print("ABC" + str(n))

Solution (Python):
print("ABC"+input())

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**9
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    N = I()

    return 'ABC{}'.format(N)



print(main())

Solution (Python):
a = input()
print("ABC" + a )

Solution (Python):

N = int(input())
print("ABC"+str(N))

Solution (Python):

N = input()
print('ABC' + N)

Solution (Python):
s = raw_input()
print 'ABC' + s

Solution (Python):
print("ABC" + input())

Solution (Python):
from sys import stdin
print 'ABC'+stdin.readline()