Problem:


Score : 100 points

Problem Statement

Snuke is going to open a contest named "AtCoder s Contest".
Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.

Snuke has decided to abbreviate the name of the contest as "AxC".
Here, x is the uppercase English letter at the beginning of s.

Given the name of the contest, print the abbreviation of the name.

Constraints

The length of s is between 1 and 100, inclusive.

The first character in s is an uppercase English letter.

The second and subsequent characters in s are lowercase English letters.

Input

The input is given from Standard Input in the following format:

AtCoder s Contest

Output

Print the abbreviation of the name of the contest.

Sample Input 1

AtCoder Beginner Contest

Sample Output 1

ABC

The contest in which you are participating now.

Sample Input 2

AtCoder Snuke Contest

Sample Output 2

ASC

This contest does not actually exist.

Sample Input 3

AtCoder X Contest

Sample Output 3

AXC



Sample input:
AtCoder Beginner Contest


Sample output:
ABC

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():
    A, s, C = input().split()

    print(A[0] + s[0] + C[0])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,s,c = input().split(" ")
print("A{}C".format(s[0]))

Submission status: Accepted

Solution code:
A,s,C = list(input().split())
ans = A[0]+s[0]+C[0] #要素連結
print(ans)

Submission status: Accepted

Solution code:
s,t,u=map(str,input().split())
print(s[0]+t[0]+u[0])

Submission status: Accepted

Solution code:
A, S, C = map(str, input().split())
print('A' + S[0] + 'C')

Submission status: Accepted

Solution code:
a , s, c = input().split()
print(f"A{s[0].upper()}C")

Submission status: Accepted

Solution code:
a, b, c = input().split()
    
str = a[0] + b[0] + c[0]
print(str)

Submission status: Accepted

Solution code:
def actual(AtCoder, s, Contest):
    return f'A{s[0].upper()}C'

AtCoder, s, Contest = input().split()
print(actual(AtCoder, s, Contest))

Submission status: Accepted

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

a, x, c = map(str, input().split())

print(a[0] + x[0] + c[0])

Submission status: Accepted

Solution code:
s=input().split();print(''.join([i[0] for i in s]))

Submission status: Accepted

Solution code:
def main():
    a, b, c = input().split(' ')
    print(a[0].upper()+b[0].upper()+c[0].upper())
main()

Submission status: Accepted

Solution code:
A, B, C = input().split()
print("A"+B[0]+"C")

Submission status: Accepted

Solution code:


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


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    return ''.join([c[0] for c in input().strip().split(' ')])


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

Submission status: Accepted

Solution code:
S=list(input().split())
ans=''
for s in S:
    ans+=s[0:1]
print(ans)

Submission status: Accepted

Solution code:
print("A%sC"%input()[8])

Submission status: Accepted

Solution code:
a,b,c= input().split()
print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
_, h, _ = input().split(' ')
print("A" + h[0] + "C")

Submission status: Accepted

Solution code:
S = input()
print("A"+S[8]+"C")

Submission status: Accepted

Solution code:

lst = list(map(str,input().split()))
#print(lst)
#print(lst[1])
print(lst[0][0]+lst[1][0]+lst[2][0])

Submission status: Accepted

Solution code:
s = list(map(str,input().split()))
print("A"+s[1][0]+"C")

Submission status: Accepted

Solution code:
a = list(map(str, input().split()))
print(a[0][0]+a[1][0]+a[2][0])

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()

print(s1[0:1]+s2[0:1]+s3[0:1])

Submission status: Accepted

Solution code:
print("A" + input()[8:9] + "C")

Submission status: Accepted

Solution code:
#!python3

# input
x, s, y = input().split()


def main():
    ans = "A{}C".format(s[0])
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print(''.join(map(lambda x: x[0], input().split(' '))))

Submission status: Accepted

Solution code:
s = input().split()
print('A{}C'.format(s[1][0]))

Submission status: Accepted

Solution code:
A = list(input().split())
print(A[0][0]+A[1][0]+A[2][0])

Submission status: Accepted

Solution code:
print('A'+(input().split())[1][0]+'C')

Submission status: Accepted

Solution code:
s = input()
print('A'+s[8]+'C')

Submission status: Accepted

Solution code:
s = list(input())
print('A', end='')
for i in range(len(s)):
    if s[i] == ' ':
        print(s[i + 1], end='')
        break
print('C')

Submission status: Accepted

Solution code:
a, b, c = input().split()
print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
a,s,c = input().split()
print(a[0] + s[0]+ c[0])

Submission status: Accepted

Solution code:
a,s,c = input().split()

print(a[0]+s[0]+c[0])

Submission status: Accepted

Solution code:
print(''.join(map(lambda x: x[0].upper(),input().split())))

Submission status: Accepted

Solution code:
a = input().split()

s = a[1][0]
print("A" + s + "C")

Submission status: Accepted

Solution code:
a,s,c=input().split()
print(a[0]+s[0]+c[0])

Submission status: Accepted

Solution code:
A,s,C = input().split()
print(A[0] + s[0] + C[0])

Submission status: Accepted

Solution code:
s=list(input().split())
print("A"+s[1][0]+"C")

Submission status: Accepted

Solution code:
a, s, c = input().split()
print('A'+s[0]+'C')

Submission status: Accepted

Solution code:
a, s, c = input().split()
print(a[0]+s[0]+c[0])

Submission status: Accepted

Solution code:
a = input().split()
print(a[0][0] + a[1][0] + a[2][0])

Submission status: Accepted

Solution code:
atcoder, s, contest = input().split()
x = s[0]
print("A" + x + "C")

Submission status: Accepted

Solution code:
a = input()

initial_middle = a[8]

print('A'+ initial_middle +'C')

Submission status: Accepted

Solution code:
a,b,c=map(str, input().split())
d=str(b)[0]
e="A"+d+"C"
print(e)

Submission status: Accepted

Solution code:
a,b,c = map(str,input().split())
print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
a,b,c = input().split()

ans = "A" + b[0] + "C"
print(ans)

Submission status: Accepted

Solution code:
A, s, C = input().split()
print("A"+ s[0] + "C")

Submission status: Accepted

Solution code:
s, t, r = map(str, input().split())
print(s[0]+t[0]+r[0])

Submission status: Accepted

Solution code:
n=list(map(str,input().split()));print(n[0][0]+n[1][0]+n[2][0])

Submission status: Accepted

Solution code:
A, S, B =list(map(str, input().split()))
print ("A"+S[0]+"C")

Submission status: Accepted

Solution code:
l = input().split()
print('A'+l[1][0]+'C')

Submission status: Accepted

Solution code:
at,s,co=input().split()
print(at[0]+s[0]+co[0])

Submission status: Accepted

Solution code:
s = list(input().split())
print(s[0][0],s[1][0],s[2][0],sep='')

Submission status: Accepted

Solution code:
s1,s2,s3=map(str,input().split())
print(s1[0]+s2[0]+s3[0])

Submission status: Accepted

Solution code:
a, b, c = input().split()
print(a[0] + b[0] + c[0])

Submission status: Accepted

Solution code:
# Vicfred
# https://atcoder.jp/contests/abc048/tasks/abc048_a
# simulation
ins = input().split()
s = ins[1]
print('A',s[0],'C',sep='');

Submission status: Accepted

Solution code:
import sys
def main():
    s1,s2,s3=sys.stdin.readline().split()
    print(''.join([s1[0],s2[0],s3[0]]))
if __name__=='__main__':main()

Submission status: Accepted

Solution code:
a, b, c = input().split()
B = b[0].upper()
print('A'+B+'C')

Submission status: Accepted

Solution code:
a,b,c = map(str,input().split())
A = a[0]
B = b[0]
C = c[0]
print(A+B+C)

Submission status: Accepted

Solution code:
a = list(map(str,input().split()))
ans = ''
for i in a:
    ans += i[0]
print(ans)

Submission status: Accepted

Solution code:
s = input().replace("AtCoder ","").replace(" Contest","")
print("A" + s[0] + "C")

Submission status: Accepted

Solution code:
s = input()
print("A" + s[8] + "C")

Submission status: Accepted

Solution code:
x, y, z = map(str, input().split())
print('A'+y[0]+'C')

Submission status: Accepted

Solution code:
s = input()
print('A' + s[8] + 'C')

Submission status: Accepted

Solution code:
A,s,C = input().split()
print(A[0] + s[0] + C[0])

Submission status: Accepted

Solution code:
asc = input().split()
s = asc[1]
x = s[0]

print('A' + x +'C')

Submission status: Accepted

Solution code:
for s in input().split():
  print(s[0],end='')

Submission status: Accepted

Solution code:
a,b,c = input().split()
print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
a, s, c = map(str, input().split())
ans = str(a[0]+s[0]+c[0])
print(ans)

Submission status: Accepted

Solution code:
a, b, c = map(str, input().split()) 
print("A"+b[0]+"C")

Submission status: Accepted

Solution code:
print("".join(w[0] for w in input().upper().split()))

Submission status: Accepted

Solution code:
a,b,c = input().split()

print("A"+b[0]+"C")

Submission status: Accepted

Solution code:
a, s, c = input().split()

print('A' + s[0] + 'C')

Submission status: Accepted

Solution code:
S = input().split()
print(S[0][0]+S[1][0]+S[2][0])

Submission status: Accepted

Solution code:
import re
l = input()
l = l.split(' ')
s = l[1]
p = re.compile('^[A-Z][a-z]*')

result = ''
if 1 <= len(s) <= 100:
  if p.fullmatch(s):
    result = l[0][0] + s[0] + l[2][0]
print(result)

Submission status: Accepted

Solution code:
name = input().split()
print("A" + name[1][0] + "C")

Submission status: Accepted

Solution code:
s,t,u = input().split()
print("{}{}{}".format(s[0],t[0],u[0]))

Submission status: Accepted

Solution code:
ls = list(map(str, input().split()))
result = ""
for s in ls:
    result += s[0].upper()
print(result)

Submission status: Accepted

Solution code:
A,x,C=input().split()
print("A"+x[0]+"C")

Submission status: Accepted

Solution code:
_, s, _ = input().split()
print('A' + s[0] + 'C')

Submission status: Accepted

Solution code:

def main():
    s1,s2,s3 = input().split()
    print("".join([s1[0],s2[0],s3[0]]))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = input()
print('A' + a[8] + 'C')

Submission status: Accepted

Solution code:
s = input().split()[1][0]

print('A{}C'.format(s))

Submission status: Accepted

Solution code:
A, middle, C = input().strip().split()

print("A"+middle[0]+"C")

Submission status: Accepted

Solution code:
S = input().split()
print(S[0][0] + S[1][0] + S[2][0])

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
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)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


n1, s, n2 = LS()
ans = 'A' + s[0] + 'C'
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,b,c = map(str, input().split())
print('A'+b[0:1]+'C')

Submission status: Accepted

Solution code:
a,b,c=(str(x) for x in input().split())
print(str.upper(a[0])+str.upper(b[0])+str.upper(c[0]))

Submission status: Accepted

Solution code:
s_1, s_2, s_3 = input().split()
print(s_1[0] + s_2[0] + s_3[0])

Submission status: Accepted

Solution code:
a,b,c =input().split()
print(str.upper(a[0]+b[0]+c[0]))

Submission status: Accepted

Solution code:

l=list(map(str,input().split()))

# print(l)
l2=list(l[1])
axc=str('A'+l2[0]+'C')
print(axc)

Submission status: Accepted

Solution code:
s = input().split()
print(s[0][0]+s[1][0].upper()+s[2][0])

Submission status: Accepted

Solution code:
con_name = input().split()
s = con_name[1]

print('A' +s[0]+ 'C')

Submission status: Accepted

Solution code:
A = list(input().split())
print(A[0][0] + A[1][0] + A[2][0])

Submission status: Accepted

Solution code:
a,b,c = input().split()

print(a[0] + b[0] + c[0])

Submission status: Accepted

Solution code:
a,b,c=input().split()
print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
import re
a=input()
q=re.fullmatch(r'AtCoder(\s+)(\w+)(\s+)Contest',a)
print('A'+q.group(2)[0]+'C')

Submission status: Accepted

Solution code:
a,s,c=map(str,input().split())
s=s[0]
print('A'+s+'C')

Submission status: Accepted

Solution code:
S = input()
print("A"+ S[8] +"C")

Submission status: Accepted

Solution code:
a,b,c = input().split()

print("A"+b[0].upper()+"C")

Submission status: Accepted

Solution code:
s=input()
print('A' + s[8] + 'C')

Submission status: Accepted

Solution code:
A,x,C=input().split()
print("A"+x[0]+"C")

Submission status: Accepted

Solution code:
C = input().split()

print(C[0][0] + C[1][0] + C[2][0])

Submission status: Accepted

Solution code:
a = list(map(str,input().split()))
print(a[0][0]+a[1][0]+a[2][0])

Submission status: Accepted

Solution code:
x, y, z = input().split()
print(x[0]+y[0]+z[0])

Submission status: Accepted

Solution code:
x, y, z = input().split()
print(x[0] + y[0] + z[0])

Submission status: Accepted

Solution code:
a,b,c = list(map(str,input().split()))

print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
print(''.join(s[0] for s in input().split()))

Submission status: Accepted

Solution code:
print("".join([i[0] for i in input().split(" ")]))

Submission status: Accepted

Solution code:
a,s,c=input().split()
print('A'+s[0:1]+'C')

Submission status: Accepted

Solution code:
A,X,C=input().split()
print("A"+X[0]+"C")

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():
    a=input().split()
    print('A'+a[1][0]+'C')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
def LS(): return list(stdin.readline().rstrip().split())
ls = LS()
a,b,c = [ls.pop(0) for i in range(3)]

ans = a[0] + b[0] + c[0]

print(ans)

Submission status: Accepted

Solution code:
A,s,C=map(str,input().split())
print('A',s[0],'C', sep="")

Submission status: Accepted

Solution code:
a, b, c = map(str, input().split())
print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
a, b, c = input().split()

print("A" + b[0] + "C")

Submission status: Accepted

Solution code:
a, b, c = input().split()

b = str.upper(b[0])
print("A" + b + "C")

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())
    
    
    a, b, c = input().split()
    print('A' + b[0] + 'C')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,x,C = map(str, input().split())
print("A"+x[0].upper()+"C")

Submission status: Accepted

Solution code:
line = input().split()

print('A' + line[1][0] + 'C')

Submission status: Accepted

Solution code:
n=input()
print("A"+n[8]+"C")

Submission status: Accepted

Solution code:
S = input().split()
ans = S[0][0] + S[1][0] + S[2][0]
print(ans)

Submission status: Accepted

Solution code:
_, s, _ = map(str, input().split())
print("A{}C".format(s[0]))

Submission status: Accepted

Solution code:
a, s, c = input().split()
print(a[0] + s[0] + c[0])

Submission status: Accepted

Solution code:
a = input().split()
print(a[0][0:1] + a[1][0:1] + a[2][0:1])

Submission status: Accepted

Solution code:
t = input()
print("A"+t[8]+"C")

Submission status: Accepted

Solution code:
def main():
 name =input().split()
 print(name[0][0]+name[1][0]+name[2][0])
 
main()

Submission status: Accepted

Solution code:
l=input().split()
print(list(l[0])[0]+list(l[1])[0]+list(l[2])[0])

Submission status: Accepted

Solution code:
def cin():
	return map(int,input().split())

def cino(test=False):
    if not test:
        return int(input())
    else:
        return input()
def cina():
  return list(map(int,input().split()))

def ssplit():
    return list(input().split())

a = ssplit()
print("A"+a[1][0].upper()+"C")

Submission status: Accepted

Solution code:
x= input().split()

print(x[0][0]+x[1][0]+x[2][0])

Submission status: Accepted

Solution code:
print("".join(map(lambda string: string[0], input().split())))

Submission status: Accepted

Solution code:
print('A'+input()[8]+'C')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 17:46:23 2020

@author: shinba
"""

a,b,c = map(str,input().split())

print("A"+b[0].upper()+"C")

Submission status: Accepted

Solution code:
inputs = input().split()

middle_head = str.upper(str(inputs[1][0]))

print("A{0}C".format(middle_head))

Submission status: Accepted

Solution code:
ss=input().split()
s=[si[0].upper() for si in ss]
print("".join(s))

Submission status: Accepted

Solution code:
a, s, b = input().split()

print('A'+s[0]+'C')

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

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

#############
# Main Code #
#############

s = inputSL()

print("A"+s[1][0]+"C")

Submission status: Accepted

Solution code:
a, b, c = input().split()

print('A'+b[0]+'C')

Submission status: Accepted

Solution code:
A, s, C = input().split()
print('A{}C'.format(s[0]))

Submission status: Accepted

Solution code:
x, s, y = input().split()
print(x[0].upper()+s[0].upper()+y[0].upper())

Submission status: Accepted

Solution code:
a, s, c = map(str, input().split())
print("A" + s[0] + "C")

Submission status: Accepted

Solution code:
print(''.join([i[0]for i in input().split()]))

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    A = input().split()
    B = []
    for a in A:
        B.append(a[0].upper())
    print(''.join(B))
 
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, x, C = map(str, input().split())
print('A{}C'.format(x[0]))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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(str, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
S = LIST()
print("A" + S[1][0] + "C")

Submission status: Accepted

Solution code:
s = input()
print('A{}C'.format(s[8]))

Submission status: Accepted

Solution code:
S = list(input().split(" "))

print("A"+S[1][0]+"C")

Submission status: Accepted

Solution code:
String1, String2, String3 = input().split()

print('A' + String2[0] + 'C')

Submission status: Accepted

Solution code:
a,b,c=map(str,input().split())
print(str.upper(a[0])+str.upper(b[0])+str.upper(c[0]))

Submission status: Accepted

Solution code:
s=str(input())
s=list(s)
print("A"+s[8]+"C")

Submission status: Accepted

Solution code:
A,s,C = input().split()
ans = ""
ans += A[0]
ans += s[0]
ans += C[0]

print(ans)

Submission status: Accepted

Solution code:
name = input().split()
print(name[0][0] + name[1][0] + name[2][0])

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7

s = input().split()
print(s[0][0] + s[1][0] + s[2][0])

Submission status: Accepted

Solution code:
s = input()
ans = s[8]
print("A"+ans+"C")

Submission status: Accepted

Solution code:
a = input()

print('A'+a[8]+'C')

Submission status: Accepted

Solution code:
S = list(map(str,input().split()))

print(S[0][0]+S[1][0]+S[2][0])

Submission status: Accepted

Solution code:
A = list(map(str,input().split()))
print(A[0][0]+A[1][0]+A[2][0])

Submission status: Accepted

Solution code:
s = input().split()[1]
print("A" + s[0] + "C")

Submission status: Accepted

Solution code:
def main():
    s = input().split()[1]
    print('A{}C'.format(s[0]))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = input().split()
print("%s%s%s" % (a[0], b[0], c[0]))

Submission status: Accepted

Solution code:
a, b, c = input().split()
ans = a[0]+b[0]+c[0]
print(ans)

Submission status: Accepted

Solution code:
s = input().split()[1]
print('A'+s[0]+'C')

Submission status: Accepted

Solution code:
AtCoder, s, Contest = input().split()

print(AtCoder[0]+s[0]+Contest[0])

Submission status: Accepted

Solution code:
a,b,c=input().split();print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
s = input()

print("A" + str(s[8]) + "C")

Submission status: Accepted

Solution code:
listA = list(input().split())
print("A"+listA[1][0]+"C")

Submission status: Accepted

Solution code:
a, b, c = input().split()

print( 'A' + b[0] + 'C' )

Submission status: Accepted

Solution code:
a, b, c = map(str, input().split())
print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
S = input()

print('A'+S[8]+'C')

Submission status: Accepted

Solution code:
s = input().split()
print('A' + s[1][0] + 'C')

Submission status: Accepted

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

a, b, c = input().split()

print("A"+b[0]+"C")

Submission status: Accepted

Solution code:
def ABC_48_A():
    A,B,C = map(str, input().split())
    print('A' + B[0] + 'C')


if __name__ == '__main__':

    ABC_48_A()

Submission status: Accepted

Solution code:
s=input()
print('A'+s[8]+'C')

Submission status: Accepted

Solution code:
a,b,c = map(str,input().split())
s = list(b)
print('A'+str(b[0]+'C'))

Submission status: Accepted

Solution code:
a, s, c = input().split()
print("A", s[0], "C", sep="")

Submission status: Accepted

Solution code:
A, s, C = input().split()
A = A[0]
s = s[0]
C = C[0]
print(A + s + C)

Submission status: Accepted

Solution code:
array = input().split()
print('A'+array[1][0].upper()+'C')

Submission status: Accepted

Solution code:
a, s, c = map(str, input().split())
print("A{}C".format(s[0]))

Submission status: Accepted

Solution code:
Ss = input().split()
print(Ss[0][0] + Ss[1][0] + Ss[2][0])

Submission status: Accepted

Solution code:
S=input().split();print('A'+S[1][0]+'C')

Submission status: Accepted

Solution code:
A, B, C = input().split()

print("A" + B[0] + "C")

Submission status: Accepted

Solution code:
a, s, c = (str(x) for x in input().split())
print(str(a[0] + s[0] + c[0]))

Submission status: Accepted

Solution code:
a, b, c = input().split()

print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
S = list(input().split())

print("A"+S[1][0]+"C")

Submission status: Accepted

Solution code:
s=input().split()
print("A"+s[1][0]+"C")

Submission status: Accepted

Solution code:
A,B,C = input().split()
print("A",end="")
print(B[0],end="")
print("C")

Submission status: Accepted

Solution code:
s = input()
print(s[0] + s[8] + s[-7])

Submission status: Accepted

Solution code:
a = list(input().split())
print(a[0][0] + a[1][0] + a[2][0])

Submission status: Accepted

Solution code:

def resolve():
    S = input().split()
    print(S[0][0]+S[1][0]+S[2][0])
    


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
print("A"+input().split()[1][0]+"C")

Submission status: Accepted

Solution code:
#ABC048A https://atcoder.jp/contests/abc048/tasks/abc048_a

a,b,c=input().split()

print(a[0],b[0],c[0],sep="")

Submission status: Accepted

Solution code:
a = input().split()
ans = [a[0][0],a[1][0],a[0][2]]
print(''.join(ans))

Submission status: Accepted

Solution code:
a,b,c = input().split()

print(a[0],b[0],c[0],sep='')

Submission status: Accepted

Solution code:
l=list(input().split())
print(l[0][0]+l[1][0]+l[2][0])

Submission status: Accepted

Solution code:
A,x,C = input().split()
print('A'+x[0]+'C')

Submission status: Accepted

Solution code:
name = input().split(' ')[1]

print('A'+name[0]+'C')

Submission status: Accepted

Solution code:
_, s, _ = input().split()
print('A' + s[0].capitalize() + 'C')

Submission status: Accepted

Solution code:
p,q,r=map(str,input().split())
print(p[0]+q[0]+r[0])

Submission status: Accepted

Solution code:
print('A' + input().split(' ')[1][0] + 'C')