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

N_str = str(N)

ans = 'ABC' + N_str

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(s+n)

Submission status: Accepted

Solution code:
n = str(input())

print("ABC" + n)

Submission status: Accepted

Solution code:
def abcnumber(n):

    return "ABC" + str(n)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()

print("ABC"+str(N))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力　数字（文字列）
N = input()

ans = "ABC" + N
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools

# import numpy as np

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

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

print('ABC'+S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
print("ABC"+input())

Submission status: Accepted

Solution code:
N = input()

ans = 'ABC' + N

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:


import numpy as np
import fractions as fra


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = "ABC%03d" % n

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
number=input()

print("ABC"+number)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print('ABC{:03d}'.format(n))

Submission status: Accepted

Solution code:
N = str(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 = str(input())
print("ABC{}".format(n))

Submission status: Accepted

Solution code:
import sys

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

def main():
    return 'ABC' + n

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = str(input())

print('ABC' + n)

Submission status: Accepted

Solution code:
import math

print("ABC" + input())

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()

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

Submission status: Accepted

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

print(title)

Submission status: Accepted

Solution code:
# ABC068a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

n = input()[:-1]
print('ABC'+n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

print("ABC" + S)

Submission status: Accepted

Solution code:
from sys import stdin

s = stdin.readline().rstrip()

print("ABC"+s)

Submission status: Accepted

Solution code:
N = int(input())

print("ABC" + str(N))

Submission status: Accepted

Solution code:
import sys

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

N = int(readline())

print('ABC' + str(N))

Submission status: Accepted

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

#入力
#A, B = map(int, input().split())
N = int(input())

print ("ABC" + str(N))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = str(input())

print('ABC' + N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = input()
n = '00'+N
m = n[-3:]
print('ABC'+m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC068A - ABCxxx
def main():
    N = input().rstrip()
    print("ABC", N, sep="")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
# ABC068 A - ABCxxx
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()

print('ABC'+N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print("ABC" + str(N))

Submission status: Accepted

Solution code:
#list(map(int, input().split()))
print('ABC'+input())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n = str(input().rstrip('\n'))
    print("ABC" + n)


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

print('ABC'+str(N))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
len_n = len(n)
ans = "ABC" + n
if len_n == 1:
    ans = "ABC00" + n
elif len_n == 2:
    ans = "ABC0" + n
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=STR()
    print('ABC'+n)
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

print("ABC" + n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print('ABC'+str(N))

Submission status: Accepted

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

Submission status: Accepted

Solution code:



def main():


    print('ABC'+input())




if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    

S=input()

print("ABC"+S)

Submission status: Accepted

Solution code:
N = int(input())

print('ABC' + str(N))

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

n = input()

print('ABC'+ n)

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = str(input())

print("ABC"+N)

Submission status: Accepted

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

print(ans+N)

Submission status: Accepted

Solution code:
N = int(input())

print( 'ABC' + str(N) )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print('ABC{:0=3}'.format(N))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
if 100 <= n <= 999:
    print('ABC' + str(n))
else:
    print('hoge!')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import  math
import bisect
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

Submission status: Accepted

Solution code:
N = str(input())

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

Submission status: Accepted

Solution code:
N=str(1000+int(input()))
print("ABC"+N[1:])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python
print("ABC" + input().zfill(3))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    test()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

print('ABC' + str(a))

Submission status: Accepted

Solution code:
N = input()

print('ABC' + N)

Submission status: Accepted

Solution code:
# n,m=map(int,input().split())
n=input()

print('ABC'+n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(N: int):
    print("ABC"+str(N))
    return


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:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#68

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# input
N = input()

# solve & output
print('ABC' + N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    print("ABC" + str(N))
    
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
N = int(input())

print("ABC" + str(N))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

print('ABC' + s)

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

n = int(input())

print('ABC{:03d}'.format(n))

Submission status: Accepted

Solution code:
n = int(input())
print("ABC{:03d}".format(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:
#!/usr/bin/env python3
#ABC68 A

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print("ABC" + "{:03}".format(n))

Submission status: Accepted

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = input()
    ans = "000"

    if len(N) == 1:
        ans = "ABC00" + N
    elif len(N) == 2:
        ans = "ABC0" + N
    else:
        ans = "ABC" + N

    print(ans)


if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

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

Submission status: Accepted

Solution code:
a = input()

print("ABC" + a)

Submission status: Accepted

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

Submission status: Accepted

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


def solve(N: int):
    ret = 'ABC' + str(N)
    print(ret)
    return


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


abc()

Submission status: Accepted

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

s = input()

print('ABC'+s)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc068/tasks/abc068_a
N = input()
print("ABC"+N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:


def read_input():
    n = input()
    return n


def submit():
    n = read_input()
    print('ABC' + n)

if __name__ == '__main__':
    submit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n = f()[0]
    print('ABC' + str(n))

solve()

Submission status: Accepted

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

import itertools
from collections import Counter
from collections import defaultdict
import bisect

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print('ABC' + input())

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math


N = int(input())

print("ABC"+str(N))

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    
    print('ABC'+a)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


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


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


print('ABC{:03d}'.format(int(input())))

Submission status: Accepted

Solution code:
# ABC068A - ABCxxx
print('ABC', input(), sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

print("ABC" + str(n))

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    N = int(input())

    return 'ABC' + str(N)


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

Submission status: Accepted

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

n = input()

print("ABC" + n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def abcxxx(N: int)->str:
    return 'ABC'+str(N)


if __name__ == "__main__":
    N = int(input())
    ans = abcxxx(N)
    print(ans)