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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

ans = 'ABC' + str(N)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]

s = input()

print("ABC"+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

print('ABC'+N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

print("ABC" + n)

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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


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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = input()

print('ABC'+n)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()

print("ABC"+n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
a = input()

print("ABC"+a)

Submission status: Accepted

Solution code:
s = input()

print("ABC"+"0"*(3-len(s))+s)

Submission status: Accepted

Solution code:
n = input()

print("ABC"+ n)

Submission status: Accepted

Solution code:
n = input()

print('ABC'+n)

Submission status: Accepted

Solution code:
n = int(input())

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

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:
n = input()
s='0'*(3-len(n))+n
print("ABC{}".format(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

print('ABC' + n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = int(input())

print(f'ABC{N}')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()

print('ABC'+n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print("ABC"+str(N))

Submission status: Accepted

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

print("ABC"+str(N))

Submission status: Accepted

Solution code:
N = input()

str = "ABC" + N

print(str)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

n = str(input())

print('ABC' + n)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    ans = "ABC" + str(N)

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print('ABC' + N)

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

print("ABC"+N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = str(input())

print('ABC'+N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    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()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: <encoding name> -*-

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
if len(n)==3:
    print("ABC"+n)
elif len(n)==2:
    print("ABC"+"0"+n)
else:
    print("ABC"+"00"+n)

Submission status: Accepted

Solution code:
n = input()

print('ABC' + n)

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
#Nをint型で取得する(Stringでも良い)
n = int(input())
#'ABC'と連結して出力する。
print('ABC' + str(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
n = int(input())

print('ABC' + str(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Tue May 12 14:59:02 2020

@author: shinba
"""

n = input()

print("ABC"+n)

Submission status: Accepted

Solution code:
n = int(input())

print('ABC'+str(n))

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
s = "ABC"

print(s + n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# region header
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
# endregion
print('ABC' + rs())

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_68_A()

Submission status: Accepted

Solution code:
n = str(input())

print("ABC" + n)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

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

print('ABC'+ str(N))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print("ABC"+input())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n = input()
    print('ABC%s' % n)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

print("ABC" + N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s="ABC"

print(s+str(input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
N = str(input())

print('ABC' + N )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

print("ABC"+N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc068/tasks/abc068_a

N = input()

ans = 'ABC' + N
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

print("ABC"+input())

Submission status: Accepted

Solution code:
N=input()

print("ABC"+N)

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 068: A – ABCxxx
n = int(input())
print('ABC' + str(n))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input() #文字列
print('ABC'+n)

Submission status: Accepted

Solution code:
import math


a=input()

print("ABC"+a)

Submission status: Accepted

Solution code:
s = input()

print("ABC"+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

print("ABC"+str(N))

Submission status: Accepted

Solution code:
import math

N=input()

print('ABC'+N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

print("ABC" + s)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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))  # type: int
    solve(N)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - ABCxxx
n=input()
print("ABC"+n)

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N = input()

print('ABC' + N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    #input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations
    #from itertools import accumulate, product
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    #from operator import itemgetter

    #mod = 1000000007

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#068_A
print('ABC'+input())

Submission status: Accepted

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

Submission status: Accepted

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

s=input().strip()

print( "ABC" + s )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = input()

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