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 "A x C".
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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


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

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

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

Solution (Python):
print(f'A{input()[8]}C')

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

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

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

Solution (Python):


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

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

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

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

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

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

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

Solution (Python):

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


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

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

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

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

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

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

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

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

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

Solution (Python):



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


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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a = input()

initial_middle = a[8]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):



ins = input().split()
s = ins[1]
print('A',s[0],'C',sep='');

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    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()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

"""
Created on Thu May 14 17:46:23 2020

@author: shinba
"""

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

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

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

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

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

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

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

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

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

Solution (Python):






import sys
input = sys.stdin.readline

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






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






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


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


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


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


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





s = inputSL()

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

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

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

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

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

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

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

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

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

Solution (Python):

A, x, C = map(str, input().split())
print('A{}C'.format(x[0]))

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

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

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

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

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

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

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

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

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

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

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

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

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

print(ans)

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

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

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

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

Solution (Python):
a = input()

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

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

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

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

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

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

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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
s = input()

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

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

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

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

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

Solution (Python):
S = input()

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

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

Solution (Python):


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

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

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


if __name__ == '__main__':

    ABC_48_A()

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

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

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

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

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

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

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

Solution (Python):
a,b,c=input().split()
print(a[0],b[0],c[0],sep="")

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

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

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

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

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

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

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

Solution (Python):

import sys
input = sys.stdin.readline









S = list(input().split())

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

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

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

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

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

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

Solution (Python):

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


if '__main__' == __name__:
    resolve()

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

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

Solution (Python):


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

u=input().rstrip().split(" ")
print("A"+u[1][0]+"C")

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

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

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

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

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

Solution (Python):
print('A'+input()[8:9].upper()+'C')

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

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

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

Solution (Python):
s = input().split()

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

Solution (Python):

S = str(input())
print("A"+S[8]+"C")

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

Solution (Python):
a=input().split(' ')
b=a[1]
c=list(str(b))
d=c[0]
print('A',d,'C',sep='')

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

Solution (Python):


s = input()
x = s.split()

ans = x[0][0] + x[1][0] + x[2][0]

print(ans)

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

Solution (Python):
a=[i for i in input().split()]
print(a[0][0]+a[1][0]+a[2][0])

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

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

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

Solution (Python):
li = input().split()
print("A"+li[1][0].upper()+"C")

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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

Solution (Python):
a,b,c=[str(i) for i in input().split()]
print("A"+b[0]+"C")

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

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

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

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

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

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

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

Solution (Python):
a, b, c = map(str, input().split())
s1 = ord(a[0])
s2 = ord(b[0])
s3 = ord(c[0])

c1 = chr(s1)
c2 = chr(s2)
c3 = chr(s3)
print(c1 + c2 + c3)

Solution (Python):
A = input().split()
ans = [s[0] for s in A]
print(*ans, sep='')

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    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
    

    
    

    a,b,c = input().rstrip().split()
    print(a[0]+b[0]+c[0])

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

middle = b.capitalize()

print("A{}C".format(middle[0]))

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

Solution (Python):
a,s,c = list(map(str,input().split()))

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

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

Solution (Python):
atcoder, s, contest = input().split()
print('A' + s[0].upper() + 'C')

Solution (Python):
def resolve():
	s = input().split()
	print("A" + s[1][0].upper() + "C")
resolve()

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

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

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

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

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

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

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

Solution (Python):
a, o, b = input().split()

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

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

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

Solution (Python):
x = list(map(str, input().split()))
head = x[1]
name = ['A', head[0],'C']
print(''.join(name))

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

print(a, end="")
print(b, end="")
print(c, end="")

Solution (Python):
inputa,inputb,inputc=input().split()
print(inputa[0]+inputb[0]+inputc[0])

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

Solution (Python):
a, s, c = map(str, input().split())

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

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

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

Solution (Python):
x = list(input().split())
print('A{}C'.format(x[1][0]))

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

Solution (Python):


def main():
    A, S, C = input().split()
    print(A[0] + S[0] + C[0])

if __name__ == '__main__':
    main()

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

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