output_description: Print the abbreviation of the name of the contest.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      AtCoder s Contest
attempt: from collections import defaultdict, Counter
  from itertools import product, groupby, count, permutations, combinations
  from math import pi, sqrt
  from collections import deque
  from bisect import bisect, bisect_left, bisect_right
  from string import ascii_lowercase
  from functools import lru_cache
  import sys
  
  sys.setrecursionlimit(10000)
  INF = float("inf")
  YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
  dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
  dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
  
  
  def inside(y, x, H, W):
      return 0 <= y < H and 0 <= x < W
  
  
  def ceil(a, b):
      return (a + b - 1) // b
  
  
  def main():
      a, b, c = input().split()
      print("A" + b[0] + "C")
  
  
  if __name__ == "__main__":
      main()
  
problem_description: 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.
samples: [{"input": "AtCoder Beginner Contest", "output": "ABC\n    \n\nThe contest in which you are participating now.\n\n* * *"}, {"input": "AtCoder Snuke Contest", "output": "ASC\n    \n\nThis contest does not actually exist.\n\n* * *"}, {"input": "AtCoder X Contest", "output": "AXC"}]