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):
N = int(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):
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"+str(a))

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n = str(input().rstrip('\n'))
    print("ABC" + n)


if __name__ == '__main__':
    slove()

Solution (Python):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

print('ABC'+str(N))

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

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

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

Solution (Python):
n = input()
len_n = len(n)
ans = "ABC" + n
if len_n == 1:
    ans = "ABC00" + n
elif len_n == 2:
    ans = "ABC0" + n
print(ans)

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

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

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=STR()
    print('ABC'+n)
if __name__ == '__main__':
    do()

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

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):
n = input()
print("ABC" + n)

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

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

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

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

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

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

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

print('ABC'+str(N))

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

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

Solution (Python):



def main():


    print('ABC'+input())




if __name__ == "__main__":
    main()

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    

S=input()

print("ABC"+S)

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

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

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

print('ABC' + str(N))

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


if __name__ == "__main__":
    resolve()

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

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

print('ABC{}'.format(N))

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

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

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

Solution (Python):
n = input()

print('ABC' + n)

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

Solution (Python):
N = str(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):
N=input()
ans='ABC'

print(ans+N)

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

print( 'ABC' + str(N) )

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

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

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

print('ABC{:0=3}'.format(N))

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

Solution (Python):
n = input()

print("ABC"+n)

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

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    N = int(input())
    print("ABC{}".format(N))

if __name__ == "__main__":
    main()

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

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

Solution (Python):
n = input()

print("ABC" + n)

Solution (Python):
n = int(input())
if 100 <= n <= 999:
    print('ABC' + str(n))
else:
    print('hoge!')

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

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

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

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

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

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

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

Solution (Python):
import sys
import copy
import  math
import bisect
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

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

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

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

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

Solution (Python):
N=str(1000+int(input()))
print("ABC"+N[1:])

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

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

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

Solution (Python):

print("ABC" + input().zfill(3))

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):
print('ABC'+str(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 = int(input())
print('ABC{0:03}'.format(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):
def main():
    N = input()
    return "ABC" + N

if __name__ == '__main__':
    print(main())

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

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

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

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

Solution (Python):
print("ABC"+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 = str(input())
print('ABC'+n)

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

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

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):
N = input()
r = "ABC" + N
print(r)

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

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

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

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

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

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

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):
print("ABC"+input())

Solution (Python):
N = 'ABC' + str(input())
print (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):
N = int(input())
print('ABC{:03d}'.format(N))

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

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

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

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


if __name__ == "__main__":
    test()

Solution (Python):
N = int(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):
n = input()

print("ABC"+n)

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

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

Solution (Python):
def main():
    n=input()
    print("ABC"+n)
    
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):
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 = input()

print('ABC' + str(a))

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

import sys
INF = float("inf")


def solve(N: int):
    print("ABC"+str(N))
    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))  
    solve(N)


if __name__ == '__main__':
    main()

Solution (Python):

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

Solution (Python):
n=str(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):
print('ABC'+input())

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

Solution (Python):
n=str(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):
N = input()
ans = "ABC" + N
print(ans)

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):
N = input()
print('ABC',N, sep='')

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

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

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

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

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

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

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

Solution (Python):



N = input()


print('ABC' + N)

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

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

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

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

Solution (Python):

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 math
import itertools
 




 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    print("ABC" + str(N))
    
if __name__ == "__main__":
	main()

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

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

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

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

Solution (Python):
N = input()

print('ABC' + N)

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

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

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

Solution (Python):

N = int(input())

print("ABC" + str(N))

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

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):
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):
print("ABC"+input())

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

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

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

Solution (Python):
s = input()

print('ABC' + s)

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

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

Solution (Python):
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, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
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()
print("ABC" + str(N))

Solution (Python):



n = int(input())

print('ABC{:03d}'.format(n))

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

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

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

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

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

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

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

Solution (Python):



n = int(input())

print('ABC'+str(n))

Solution (Python):
a = input()

print('ABC' + a)

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

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

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

Solution (Python):

N = input()

ans = "ABC" + N

print(ans)

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

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

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

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

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

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

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

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

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

print("ABC" + "{:03}".format(n))

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


main()

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

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

Solution (Python):
N = input()

print('ABC'+N)

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

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

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

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

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

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

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

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

Solution (Python):
def main():
    N = input()
    ans = "000"

    if len(N) == 1:
        ans = "ABC00" + N
    elif len(N) == 2:
        ans = "ABC0" + N
    else:
        ans = "ABC" + N

    print(ans)


if __name__ == "__main__":
    main()

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

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

Solution (Python):



N = input()

print('ABC' + N)

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

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

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

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

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

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):
s=input()
print('ABC'+s)

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

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

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

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

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

Solution (Python):

import sys


def solve(N: int):
    ret = 'ABC' + str(N)
    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))  
    solve(N)

if __name__ == '__main__':
    main()

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):
n = input()
print('ABC' + n)

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

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

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

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


abc()

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

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

Solution (Python):


s = input()

print('ABC'+s)

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

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

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

Solution (Python):
n = input()

print('ABC' + n)

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

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

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'+N)

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

Solution (Python):
a = input()

print('ABC' + a)

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

Solution (Python):
N = input()
print("ABC{}".format(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):
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):
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):
x=input()
print("ABC"+x)

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

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

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

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

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

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

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

Solution (Python):
print(''.join(['ABC', input()]))

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

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

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

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

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{}'.format(N))

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

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

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

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

Solution (Python):
import sys


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








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

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

Solution (Python):
if __name__ == '__main__':
    N = int(input())
    print("ABC"+str(N))

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

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

Solution (Python):

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

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

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

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

print("ABC"+n)

Solution (Python):
n=input()

print("ABC"+n)

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

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

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

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

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

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

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

Solution (Python):


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


def submit():
    n = read_input()
    print('ABC' + n)

if __name__ == '__main__':
    submit()

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

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

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

print('ABC'+str(N))

Solution (Python):
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]
    print('ABC' + str(n))

solve()

Solution (Python):


import itertools
from collections import Counter
from collections import defaultdict
import bisect

def main():
    N = int(input())
    print("ABC{:03}".format(N))

if __name__ == '__main__':
    main()

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

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

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

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

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

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):
print("ABC"+input())

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

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

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

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math


N = int(input())

print("ABC"+str(N))

Solution (Python):
n = input()

print('ABC' + n)

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

Solution (Python):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    a = input().rstrip()
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    print('ABC'+a)
    
if __name__ == '__main__':
    main()

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

Solution (Python):
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 inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


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


print('ABC{:03d}'.format(int(input())))

Solution (Python):
N = input()

print('ABC'+N)

Solution (Python):

print('ABC', input(), sep='')

Solution (Python):

print('ABC', input(), sep='')

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):
print("ABC" + input())

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

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):
print('ABC' + input())

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

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

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

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

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

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

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

print('ABC'+N)

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

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

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):
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):
n = input()
ans = "ABC" + n
print(ans)

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

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

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

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    N = int(input())

    return 'ABC' + str(N)


if __name__ == '__main__':
    print(main())

Solution (Python):
N = input()

print("ABC"+N)

Solution (Python):


n = input()

print("ABC" + n)

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):
N = input()
print('ABC'+N)

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

Solution (Python):

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

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

Solution (Python):
def abcxxx(N: int)->str:
    return 'ABC'+str(N)


if __name__ == "__main__":
    N = int(input())
    ans = abcxxx(N)
    print(ans)

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=str(input())
print('ABC'+N)

Solution (Python):
N=int(input())
A=str(N)
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):
from sys import exit



S = str(input())


print("ABC" + S)

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

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

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

Solution (Python):

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


def A():
    n = II()
    print("ABC"+str(n))
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()