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):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

print("ABC" + input())

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

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

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

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

Solution (Python):

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


if '__main__' == __name__:
    resolve()

Solution (Python):
"""MILOYGJGJfdsgG"""
text=input()
print('ABC'+text)

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

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

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

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

Solution (Python):

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

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

Solution (Python):
s="ABC"

print(s+str(input()))

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

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

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

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

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

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

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

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

Solution (Python):
n = input()

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

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

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

print('ABC' + N )

Solution (Python):
n = input()

print('ABC' + n)

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

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

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

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

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

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

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

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

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

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

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

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

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

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 = int(input())
print('ABC{}'.format(N))

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

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

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

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

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

Solution (Python):
import sys
import os

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

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


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

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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

Solution (Python):

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

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

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

Solution (Python):


N = input()

ans = 'ABC' + N
print(ans)

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

Solution (Python):
N=input()

print("ABC"+N)

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

Solution (Python):
import sys

n = sys.stdin.readline().rstrip()

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

if __name__ ==  '__main__':
    main()

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

print('ABC' + N)

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

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

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

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

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

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

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

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

Solution (Python):
import math


a=input()

print("ABC"+a)

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

Solution (Python):
s = input()

print("ABC"+s)

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

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

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

print("ABC"+str(N))

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

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

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

Solution (Python):
import math

N=input()

print('ABC'+N)

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

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

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

print("ABC"+n)

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

Solution (Python):

import sys


def solve(N: int):
    print("ABC{}".format(N))


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

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

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

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

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

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

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

Solution (Python):









import sys



ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

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

if __name__ == '__main__':
    main()

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

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

print('ABC' + N)

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

Solution (Python):
def main():
    import sys
    
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    
    from itertools import combinations, permutations
    
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    

    

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

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

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

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

Solution (Python):

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    S=input()
    print("ABC"+S)

main()

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

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

Solution (Python):


s=input().strip()

print( "ABC" + s )

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

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

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

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

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

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

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

N_str = str(N)

ans = 'ABC' + N_str

print(ans)

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

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

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

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

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

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

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

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

Solution (Python):
def abcnumber(n):

    return "ABC" + str(n)

def main():
    n  = str(input())
    print(abcnumber(n))

if __name__ == '__main__':
    main()

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%s"%input())

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

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

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

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

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

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

Solution (Python):
str = input().split()
print("ABC" + str[0])

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

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

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

Solution (Python):




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


if __name__ == "__main__":
    main()

Solution (Python):
a = input()
print("ABC{:0>3}".format(a))

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

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

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

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

Solution (Python):
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools



read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S = readline().decode('utf8').rstrip()

print('ABC'+S)

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"+str(n))

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

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

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

Solution (Python):

print("ABC"+input())

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

Solution (Python):
N = input()

ans = 'ABC' + N

print(ans)

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

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

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

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

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

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

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

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

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

print("ABC"+n)

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

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

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

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

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

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

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

Solution (Python):


import numpy as np
import fractions as fra


print("ABC",end="")
print(input())

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

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

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

ans = "ABC%03d" % n

print(ans)

Solution (Python):
import sys


def solve(inp):
    N = int(inp.readline().strip())

    return "ABC" + str(N)


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

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
from bisect import bisect

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

print("ABC"+number)

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

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

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

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

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

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

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

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): 
    return a/gcd(a,b)*b

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

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

Solution (Python):


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

Solution (Python):
import sys
input = sys.stdin.readline
N = input()
print("ABC" + N)

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

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

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

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

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

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

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

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

Solution (Python):
N = input()

print("ABC" + N)

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

Solution (Python):
import sys

n = sys.stdin.readline().rstrip()

def main():
    return 'ABC' + n

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

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

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

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

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

Solution (Python):
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

N=one_str()

print("ABC"+N)

Solution (Python):
n = input()

print("ABC"+n)

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

print('ABC' + n)

Solution (Python):
import math

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"+str(int(input())))

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

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

Solution (Python):
n=input()

print("ABC"+n)

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

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

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

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

Solution (Python):
n = int(input().split()[0])
print("ABC" + str(n))

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

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

Solution (Python):

def main():
    buf = input()
    n = buf
    print("ABC" + n)

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

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{}".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()
title = "ABC" + N

print(title)

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

n = input()[:-1]
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):
print("ABC",input(),sep='')

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

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

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

Solution (Python):
S = input()

print("ABC" + S)

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()

print("ABC"+s)

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

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(readline())

print('ABC' + str(N))

Solution (Python):

import math



N = int(input())

print ("ABC" + str(N))

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

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

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

Solution (Python):
def examA():
    N = S()
    ans = "ABC" + N
    print(ans)

import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

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

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

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

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

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

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

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

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

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

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

print('ABC' + N)

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

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

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

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

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

print(''.join(['ABC', input().rstrip('\n')]))

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

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

Solution (Python):
print(''.join(map(str, ["ABC",int(input())])))

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

Solution (Python):

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

Solution (Python):

N = input()
n = '00'+N
m = n[-3:]
print('ABC'+m)

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

Solution (Python):
N = input()

print('ABC' + N)

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

Solution (Python):

def main():
    N = input().rstrip()
    print("ABC", N, sep="")


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=int(input())
print("ABC",end="")
print(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):

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

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    n = input()
    print("ABC"+n)
    return


if __name__ == "__main__":
    solve()

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

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

Solution (Python):

ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

N = ni()
print('ABC' + str(N))

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

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

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

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

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

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

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

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

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

Solution (Python):
N=input()

print('ABC'+N)

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

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