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



Sample input:
100


Sample output:
ABC100

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit
# A,B,C = [int(n) for n in input().split()]
# N = int(input())
# a = [int(input()) for _ in range(N)]
S = str(input())
# L = len(S)
# T = str(input())
print("ABC" + S)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
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

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

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

#A
n = input()
print("ABC"+n)
#B

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

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

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print "ABC" + raw_input()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC68
print("ABC"+input())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

N = input()

print(func(N))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

print("ABC"+input())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(ans)
print()

Submission status: Accepted

Solution code:
n = input()

print("ABC"+n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print "ABC"+raw_input()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
int_n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

ans = "ABC" + S
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 068
def getInt(): return int(input())
N = input()
print('ABC' + N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N が3桁固定なので、単純に連結するだけでもよい
# N = input()
# print("ABC"+N)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


abc068_a()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=str(input())

print("ABC"+n)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = str(input())
print("{}".format("ABC" + N))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()

print("ABC"+N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print('ABC%03d' % N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
print("ABC" + input())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n  = int(input())
print("ABC%d"%(n))

Submission status: Accepted

Solution code:
n = input()

print("ABC" + str(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Your code here!
def main():
    N = input()
    print("ABC" + N)
if __name__ == "__main__":
    main()

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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


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


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input()) # 整数

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

Submission status: Accepted

Solution code:
N = input()

print('ABC' + N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


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


# Binary converter
def to_bin(x):
    return bin(x)[2:]


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


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


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

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

    return v


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


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

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

    return v


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

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

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

        cps = n_cps[:]

    return dfk


# Depth First Search (+Distance)
def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

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

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

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

    return


# --------------------------------------------

dp = None


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


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#68a
n=input()
print('ABC'+ n )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print 'ABC' + raw_input()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n_str = input()

print("ABC" + n_str)

Submission status: Accepted

Solution code:
#coding:utf-8
n=input()
n="ABC"+n
print(n)

Submission status: Accepted

Solution code:
S=input()

print("ABC"+S)

Submission status: Accepted

Solution code:
a=input()

print('ABC'+a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N = input()

print("ABC" + N)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

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

Submission status: Accepted

Solution code:
# input
N = input()

print('ABC' + N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

print('ABC'+input())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = int(input())

print("ABC"+str(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print("ABC" + str(n))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

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

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

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

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

n = arr_data[0][0]

print("ABC"+n)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# AtCoder Beginner Contest
# Problem A

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# get a integer
a = int(raw_input())

print("ABC"+str(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n,m = map(int, input().split())
a = input()
ans = "ABC"+a

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
xxx = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

print("ABC" + str(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


N = int(input())

print('ABC%03d' % N)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
http://abc068.contest.atcoder.jp/tasks/abc068_a

"""


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = raw_input()

print "ABC" + N

Submission status: Accepted

Solution code:












































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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:



























































print('ABC'+input())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import math

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

Submission status: Accepted

Solution code:
print 'ABC'+raw_input()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

count = input()

print("ABC" + str(count))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/env python3

print('ABC' + input())

Submission status: Accepted

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

Submission status: Accepted

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

print(b)

Submission status: Accepted

Solution code:
#!usr/bim/python
#! -*- coding: utf-8 -*-


num = raw_input()

print "ABC"+num

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !
N = input()
print("ABC" + N)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys

n = sys.stdin.readline()

print ('ABC' + n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin
# -*- coding="utf-8" -*-
 
a = input()
print ("ABC" + a )

Submission status: Accepted

Solution code:
print 'ABC' + raw_input()

Submission status: Accepted

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

Submission status: Accepted

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

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

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    N = I()

    return 'ABC{}'.format(N)



print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
N = int(input())
print("ABC"+str(N))

Submission status: Accepted

Solution code:
#coding: utf-8
N = input()
print('ABC' + N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
print ('ABC%d' %N)

Submission status: Accepted

Solution code:
a = input()

print('ABC'+a)

Submission status: Accepted

Solution code:
#ABC068A

n=raw_input()
print 'ABC'+n

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(raw_input())
print "ABC{}".format(N)

Submission status: Accepted

Solution code:
import sys


def main():
    args = sys.stdin.readline().split()
    N = int(args[0])

    print('ABC' + str(N))

main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python

num = input()

print("ABC" + num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()

ans="ABC"+n

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !
N=input()
print("ABC"+str(N))

Submission status: Accepted

Solution code:
nb = int(input())
print("ABC",end = "")
print(nb)

Submission status: Accepted

Solution code:
n = map(int, raw_input().split())[0]

print ("ABC%s" % n)

Submission status: Accepted

Solution code:
# coding: utf-8

print("ABC" + input())

Submission status: Accepted

Solution code:
#Python

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

Submission status: Accepted

Solution code:
number = input()
Tournament = "ABC"
Tournament += number
print(Tournament)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(raw_input())
if n >= 100 and n <= 999:
    print "ABC" + str(n)
else:
    exit

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

# sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


n = read_int()
print('ABC' + str(n))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        print("ABC{0}".format(int(line)))

if __name__ == "__main__":
    main(sys.argv)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABCxxx

N = input()

print("ABC" + N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    print('ABC', N, sep='')

main()

Submission status: Accepted

Solution code:
N=raw_input()

print 'ABC'+N

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = (input())						# 5
print("ABC" + N)

Submission status: Accepted

Solution code:
num = int(input())
print ("ABC{}".format(num))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def a():
    n = int(input())
    print('ABC'+str(n))

a()

Submission status: Accepted

Solution code:
N = input()
print("ABC" + N.zfill(3))

Submission status: Accepted

Solution code:
N = raw_input()
print('ABC' + N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys
import re
import math
import collections
import itertools
import functools

DEBUG = True
DEBUG = False

def dbg(*args):
    if DEBUG:
        print("DBG: ", file=sys.stderr, end="")
        print(*args, file=sys.stderr)



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

if __name__ == "__main__": main()

Submission status: Accepted

Solution code:
# a = list(map(int, input().split()))
# print(a)

n = int(input())

print("ABC" + str(n))

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

Solution code:
N=int(input())
import ita
data=ita.array.make1d(N)
for i in range(0,N):
    c=0
    while i%2==0:
        c=c+1
    data[i]=c
for k in range(0,N):
    if data[k]==max(data):
        print(k+1)

Submission status: Runtime Error

Solution code:
import math
from math import gcd,pi,sqrt
INF = float("inf")

import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
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)]

import string

def main():
    n,m = i_map()

    c = [[INF]*n for _ in range(n)]
    for i in range(n):
        c[i][i] = 0

    for _ in range(m):
        a,b = i_map()
        c[a-1][b-1] = 1
        c[b-1][a-1] = 1

    for i,k in enumerate(c[0]):
        if k == 1:
            if c[i][-1] == 1:
                print("POSSIBLE")
                exit()
    print("IMPOSSIBLE")


if __name__=="__main__":
    main()

Submission status: Runtime Error

Solution code:
print(ABC+input())

Submission status: Runtime Error

Solution code:
n = input().split()
print("ABC" + n)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
a=[]
for n in range(1,N,1):
  count=0
  while n%2 == 0:
    count+=1
    n/=2
  a.append(count)

print(a.index(max(a))+1)
print(Tmax=max(a))