output_description: If N is a palindromic number, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: # coding: utf-8
  
  n = int(input()) 
  t = sorted([int(input()) for i in range(n)])
  
  def gcd(a, b):
    while b:
      a, b = b, a % b
    return a
  	
  def lcm(a, b):
    return a * b // gcd(a, b)
  	
  def nlcm(list):
    if len(list) > 2:
    	lcm_num = lcm(list[0], list[1])
      for i in range(2, len(list)):
        lcm_num = lcm(lcm_num, list[i])
      print(lcm_num)
    elif len(list) == 2:
      print(lcm(list[0], list[1]))
    else:
    	print(len[-1])
  
  
  nlcm(t)
  
problem_description: Statement
  
  You are given a three-digit positive integer N.  
  Determine whether N is a _palindromic number_.  
  Here, a palindromic number is an integer that reads the same backward as
  forward in decimal notation.
samples: [{"input": "575", "output": "Yes\n    \n\nN=575 is also 575 when read backward, so it is a palindromic number. You\nshould print `Yes`.\n\n* * *"}, {"input": "123", "output": "No\n    \n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You\nshould print `No`.\n\n* * *"}, {"input": "812", "output": "No"}]