You are tasked with creating a program to determine the abbreviation for the N-th round of the AtCoder Beginner Contest (ABC). The input will be an integer N (100 ≤ N ≤ 999), and the program should output the abbreviation for the N-th round of ABC. For example, if the input is 100, the output should be ABC100.

# Buggy version:
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
# input = sys.stdin.readline 
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()


# Fixed version:
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
# input = sys.stdin.readline 
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()

# Buggy version:
def solve():
  N = input()
  
  print ('ABC') + N

if __name__ == '__main__':
    solve()


# Fixed version:
def solve():
    print("ABC"+input())


if __name__ == "__main__":
    solve()

# Buggy version:
print('ABC' input())

# Fixed version:
print(input('ABC'))

# Buggy version:
# -*- coding: <encoding name> -*-

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

# Fixed version:
# -*- coding: <encoding name> -*-

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

# Buggy version:
s=int(input())
print('ABC'+s)


# Fixed version:
s=int(input())
print('ABC'+str(s))

# Buggy version:
N = int(input())

print('ABC'+ N, end='')

# Fixed version:
N = int(input())
print("ABC", end = "")
print(N)

# Buggy version:
a = int(input())
print("ABC"+a)

# Fixed version:
a = int(input())
print("ABC" + str(a))

# Buggy version:
import sys

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

N = int(readline())

print('ABC' + N)


# Fixed version:
import sys

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

N = int(readline())

print('ABC' + str(N))

# Buggy version:
print("ABC{}".format(int(input()))

# Fixed version:
print("ABC{}".format(int(input())))

# Buggy version:
n=input()
  print('ABC'+n)

# Fixed version:
n = input()

print("ABC"+n)

# Buggy version:
i = int(input())
print("ABC"+i)

# Fixed version:
i = int(input())
print("ABC"+str(i))

# Buggy version:
N = int(input())

print("ABC" + N)

# Fixed version:
N=int(input())
print('ABC'+str(N))

# Buggy version:
n = int(input())

print("ABC" + n)


# Fixed version:
n = int(input())

print("ABC" + str(n))

# Buggy version:
N=str(inputN=input()
print('ABC{}'.format(N))

# Fixed version:
N = input()
print('ABC{}'.format(N))

# Buggy version:
N=str(input())
print("ABC"+"N")

# Fixed version:
N = input()
x = str('ABC' + str(N))
print(x)

# Buggy version:
n=int(input())
print("ABC",n)


# Fixed version:
n = int(input())
print("ABC",n,sep = '')

# Buggy version:
print("ABC" ++ input())

# Fixed version:



























































print('ABC'+input())

# Buggy version:
print("ABC{0}".format(input())

# Fixed version:
print("ABC{0}".format(input()))

# Buggy version:
n=int,input()
print('ABC',n,sep="")


# Fixed version:
print('ABC',int(input()),sep='')

# Buggy version:
print("ABC"+str(input())

# Fixed version:
print("ABC"+str(input()))

# Buggy version:
N = int(input())
print ('ABC %d' %N)


# Fixed version:
N = int(input())
print ('ABC%d' %N)

# Buggy version:
NN=str(input())
print("ABC"+N)

# Fixed version:
N=str(input())
print('ABC'+N)

# Buggy version:
a=input()
print('ABC'　+a)


# Fixed version:
a = input()
print('ABC' + a)

# Buggy version:
n=str(input())
a="ABC"
print(n+a)

# Fixed version:
a = str(input())
print("ABC" + a)

# Buggy version:
N = input()

print("ABC" + "N")

# Fixed version:
N=(input())
print('ABC'+N)