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

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

Solution (Python):
import sys

input = sys.stdin.buffer.readline
in_n = lambda: int(input())
in_nn = lambda: map(int, input().split())
in_s = lambda: input().rstrip().decode('utf-8')
in_map = lambda: [s == ord('.') for s in input() if s != ord('\n')]

MOD = 10**9 + 7
INF = 8 * 10**18


def main():

    print("ABC" + in_s())


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
s = input()

print('ABC'+s)

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

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

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

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

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

Solution (Python):

def main():
    n = input()

    print('ABC'+n)


if __name__ ==  "__main__":
    main()

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

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

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

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

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

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

ans = "{}{}".format("ABC",n)
print(ans)

Solution (Python):
n = int(input())
print(f'ABC{n:0>3}')

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

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

print('ABC' + str(n))

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

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

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

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

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

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

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


if __name__ == "__main__":
    main()

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

print('{}{}'.format('ABC', count_of_contest))

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

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

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

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

Solution (Python):



import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """100"""
        output = """ABC100"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """425"""
        output = """ABC425"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """999"""
        output = """ABC999"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    
    resolve()

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

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

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

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

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

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

print("ABC" + str(n))

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

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

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

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

Solution (Python):
N = list(input())
if len(N)==1:
    N = ["0","0"]+N
if len(N)==2:
    N = ["0"]+N
print("ABC"+"".join(N))

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

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

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

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

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

    print('ABC' + str(n))

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
def S(): return sys.stdin.readline().rstrip()

print('ABC'+S())

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

print('ABC'+input())

Solution (Python):
import sys

N = sys.stdin.readline().strip()
print("ABC" + N)

Solution (Python):
print(f'ABC{input()}')

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

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  
def LS2(): return list(sys.stdin.readline().rstrip())  

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

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

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

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

Solution (Python):
s = input()

print('ABC'+s)

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

Solution (Python):
N = input()

print("ABC" + N)

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


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

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

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

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

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

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

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

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

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

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

Solution (Python):
print(f'ABC{input()}')

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

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

Solution (Python):
string = "ABC"
N = int(input())
if 100<=N<=999 :
    print(string + str(N))

Solution (Python):
s = "ABC"
N = int(input())
if 100<=N<=999 :
    print(s + str(N))

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

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

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

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

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

Solution (Python):
n = input()

ans = 'ABC' + n
print(ans)

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

ans = 'ABC' + str(N)

print(ans)

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

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

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

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

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

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

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

Solution (Python):
import sys

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


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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):









s = input()

print("ABC"+s)

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

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

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

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

Solution (Python):
N = input()

print('ABC'+N)

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

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

Solution (Python):
n = input()

print("ABC" + n)

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


if __name__ == "__main__":
    solve()

Solution (Python):
s=input()
print(f"ABC{s}")

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


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

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
n=input()

print("ABC"+n)

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

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

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N = readline().strip()
    print('ABC' + N)
    
    return


if __name__ == '__main__':
    main()

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"+"0"*(3-len(s))+s)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
n = input()

print('ABC' + n)

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

Solution (Python):
n = int(input())
print(f'ABC{n}')

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

Solution (Python):


N = int(input())

print(f'ABC{N}')

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

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

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

Solution (Python):
print(f"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):
a = input()
print("ABC"+a)

Solution (Python):
n = int(input())
print(f'ABC{n}')

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):
print("ABC{}".format(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())

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

Solution (Python):
N=input()

ans = 'ABC'+N
print(ans)

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

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

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

print('ABC'+n)

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

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

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):
import sys
N = int(input())
if N < 100 or N > 999:
    sys.exit()

print("ABC"+str(N))

Solution (Python):
import sys
N = int(input())
if N < 100 or N > 999:
    sys.exit()

print("ABC"+str(N))

Solution (Python):
N = input()

str = "ABC" + N

print(str)

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

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

print('ABC' + n)

Solution (Python):
def actual(N):
    return f'ABC{N}'

N = int(input())
print(actual(N))

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

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

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

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

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

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

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

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

Solution (Python):
n = str(input())
print("ABC" + n if len(n) == 3 else "ABC0" + n)

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

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

Solution (Python):
import sys

input = sys.stdin.readline


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

    ans = "ABC" + str(N)

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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)

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

print('ABC'+N)

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

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

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

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

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    print("ABC"+input())


if __name__ == "__main__":
    main()

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):
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):
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):
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):
def li():
    return list(map(int, input().split()))
def mi():
    return map(int, input().split())
def ii():
    return int(input())

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):
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):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n = readline().decode()
print('ABC' + n)

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

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

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

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

Solution (Python):
n = int(input())
print('ABC{:03}'.format(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):
n = input()
if len(n)==3:
    print("ABC"+n)
elif len(n)==2:
    print("ABC"+"0"+n)
else:
    print("ABC"+"00"+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):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    n = input()
    print("ABC" + n)


if __name__ == '__main__':
    resolve()

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

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

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

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

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

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

Solution (Python):
def inpl(): return list(map(int, input().split()))
N = int(input())
print("ABC{}".format(N))

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

print("ABC"+str(n))

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    N = int(input())
    print("ABC" + str(N))

    return 0

if __name__ == "__main__":
    solve()

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

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

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

Solution (Python):

print("ABC" + input())

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    print('ABC'+str(int(input())))
    
resolve()

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

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

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

"""
Created on Tue May 12 14:59:02 2020

@author: shinba
"""

n = input()

print("ABC"+n)

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

print('ABC'+str(n))

Solution (Python):
import sys
import math
import bisect

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

Solution (Python):
def main():
    n = int(input())
    ans = 'ABC{}'.format(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 = 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 = input()
s = "ABC"

print(s + n)

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

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

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7

print('ABC' + rs())

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

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

if __name__ == '__main__':

    ABC_68_A()

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

print("ABC" + n)

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

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

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

if __name__ == '__main__':
    main()

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

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

print('ABC'+ str(N))

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

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

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 accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
N = INT()

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

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

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

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

Solution (Python):


print("ABC"+input())

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


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):
def main():
    n = input()
    print('ABC%s' % n)

if __name__ == '__main__':
    main()

Solution (Python):
N = input()

print('ABC'+N)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

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

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

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

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

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

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

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