output_description: Print a string as stated in Problem Statement.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      K
      S
attempt: import sys
  
  sys.setrecursionlimit(10**6)  # 再帰関数の再帰の深さを設定
  to_index = lambda x: int(x) - 1  # 入力した数字に1を引いたものを返す
  print_list_in_2D = lambda x: print(
      *x, sep="\n"
  )  # リストの要素を改行を挟んで表示する関数
  
  
  # 入力を整数に変換して受け取る
  def input_int():
      return int(input())
  
  
  def map_int_input():
      return map(int, input())
  
  
  MII = map_int_input
  
  
  def MII_split():
      return map(int, input().split())
  
  
  def MII_to_index():
      return map(to_index, input())
  
  
  def MII_split_to_index():
      return map(to_index, input().split())
  
  
  # 入力全てを整数に変換したものの配列を受け取る
  def list_int_inputs():
      return list(map(int, input()))
  
  
  LII = list_int_inputs
  
  
  def LII_split():
      return list(map(int, input().split()))
  
  
  # 2次元リスト化
  def LII_2D(rows_number):
      return [LII() for _ in range(rows_number)]
  
  
  def LII_split_2D(rows_number):
      return [LII_split() for _ in range(rows_number)]
  
  
  K = input_int()
  S = input()
  
  if len(S) > K:
      S = S[:K]
      S += "..."
  print(S)
  
problem_description: Statement
  
  We have a string S consisting of lowercase English letters.
  
  If the length of S is at most K, print S without change.
  
  If the length of S exceeds K, extract the first K characters in S, append
  `...` to the end of them, and print the result.
samples: [{"input": "7\n    nikoandsolstice", "output": "nikoand...\n    \n\n`nikoandsolstice` has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append `...` to the\nend of them, and print the result `nikoand...`.\n\n* * *"}, {"input": "40\n    ferelibenterhominesidquodvoluntcredunt", "output": "ferelibenterhominesidquodvoluntcredunt\n    \n\nThe famous quote from Gaius Julius Caesar."}]