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
  
  stdin = sys.stdin
  inf = 1 << 60
  mod = 1000000007
  
  sys.setrecursionlimit(10**7)
  
  ni = lambda: int(ns())
  nin = lambda y: [ni() for _ in range(y)]
  na = lambda: list(map(int, stdin.readline().split()))
  nan = lambda y: [na() for _ in range(y)]
  nf = lambda: float(ns())
  nfn = lambda y: [nf() for _ in range(y)]
  nfa = lambda: list(map(float, stdin.readline().split()))
  nfan = lambda y: [nfa() for _ in range(y)]
  ns = lambda: stdin.readline().rstrip()
  nsn = lambda y: [ns() for _ in range(y)]
  ncl = lambda y: [list(ns()) for _ in range(y)]
  nas = lambda: stdin.readline().split()
  
  k = ni()
  s = ns()
  
  if len(s) <= k:
      print(s)
  else:
      print(s[:k] + "...")
  
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."}]