Problem:
 Score: 200 points    Problem 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.      Constraints   K is an integer between 1 and 100 (inclusive).  S is a string consisting of lowercase English letters.  The length of S is between 1 and 100 (inclusive).         Input  Input is given from Standard Input in the following format:  K  S       Output  Print a string as stated in Problem Statement.        Sample Input 1 7
nikoandsolstice      Sample Output 1 nikoand...  nikoandsolstice has a length of 15 , which exceeds K=7 .  We should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand... .       Sample Input 2 40
ferelibenterhominesidquodvoluntcredunt      Sample Output 2 ferelibenterhominesidquodvoluntcredunt  The famous quote from Gaius Julius Caesar.

Solution (Python):
n = int(input())
st_t = input('')
st_t = str(st_t)
if(len(st_t) > n):
    print(st_t[:n] + '...')
else:
    print(st_t)

Solution (Python):
K = int(input())
S = str(input())
if len(S) <= K:
    print(S)
else:
    print(S[:K]+'...')

Solution (Python):
n = int(input())
s = input()
if len(s) >n:
    print(s[:n] + "...")
else:
    print(s)

Solution (Python):
k = int(input())
s = input()
n = len(s)

if n <= k:
    print(s)
else:
    print(s[0:k], end="")
    print("...")

Solution (Python):
k = int(input())
s = str(input())
if len(s) <= k:
    print(s)
else:
    print((s[:k]) + "...")

Solution (Python):
K=int(input())
S=input()
if K>=len(S):
	print(S)
else:
	mae=S[0:K]
	ans=mae+"..."
	print(ans)

Solution (Python):
K = int(input())
S = input()

K = min(len(S), K)
for i in range(K):
    print(S[i], end='')

print('...' if K < len(S) else '')

Solution (Python):
k = int(input())
s = input()

if len(s)>k:
  print(s[:k]+'...')
else:
  print(s)

Solution (Python):
K = int(input())
S = input()
if len(S) <= K:
    print(S)
else:
    print(S[:K]+'...')

Solution (Python):
K = int(input())
S = input()

if K < len(S):
  print(S[0:K] + '...')
else:
  print(S)

Solution (Python):
k = int(input())
s = str(input())

g = len(s) - k
if len(s) <= k:
  print(s)
else:
  print(s[:-g] + "...")

Solution (Python):
k=int(input())
s=input()
if len(s)<=k:
    print(s)
else:
    print(s[:k]+'...')

Solution (Python):
k = int(input())
s = input()
if len(s) <= k:
  print(s)
else:
  print(s[:k] + '...')

Solution (Python):
K = int(input())
S = list(input())
if len(S) > K:
    print(''.join(S[:K]) + '...')
else:
    print(''.join(S))

Solution (Python):
def sol():
  k=int(input())
  s=input()
  if len(s)>k:
    return s[:k]+'...'
  return s

print(sol())

Solution (Python):
k=int(input())
s=input()
l=len(s)
if k >= l:
  print(s)
else:
  print(s[:k]+"...")

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print('{}{}'.format(S[0:K], '...'))

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
  print(S)
else :
  print(S[:K] + '...')

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[0:K] + '...')

Solution (Python):
n = int(input())
s = str(input())
if len(s) <= n:
  print(s)
else:
  print(s[:n]+"...")

Solution (Python):
k =int(input())
s= list(input())

if len(s) >k:
    s1 = s[0:k]
    s2 = "".join(s1)
    print(s2+"...")
else:
    s2 = "".join(s)
    print(s2)

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[:K] + "...")

Solution (Python):
if __name__ == "__main__":
    K = int(input())
    S = input()
    if K >= len(list(S)):
        print(S)
    else:
        print(S[:K], end='')
        print("...")

Solution (Python):

k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    ans = s[:k] + '...'
    print(ans)

Solution (Python):
k=int(input())
s=input()
n=0
result=''
if k < len(s):
    while n<k:
        result+=s[n]
        n+=1
    result+='...'
else:
    result=s
print(result)

Solution (Python):
k = int(input())
s = input()

if k >= len(s):
    print(s)
else:
    print(s[0:k]+'...')

Solution (Python):
K = int(input())
S = input()
if len(S) <= K :
    print(S)
else :
    print(S[0:K]+ '...')

Solution (Python):

K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[0:K], "...", sep="")

Solution (Python):
K = int(input())
S = input().strip()

if K >= len(S):
    print(S)
else:
    print(f'{S[:K]}...')

Solution (Python):
K = int(input())
S = input()
if len(S) <= K:
    print(S)
else:
    print(S[:K] + "...")

Solution (Python):
k = int(input())
S = input()
s = list(S)

if len(s) <= k:
    print(S)
else:
    print(S[0:k] + "...")

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
  print(s)
else:
  print(s[:k] + '...')

Solution (Python):
K = int(input())
S = input()

if K < len(S):
    print(S[:K]+'...')
else:
    print(S)

Solution (Python):
k = int(input())

str_list=list(input())


if len(str_list)<=k:
    print("".join(str_list))
else:
    print("".join(str_list[0:k])+'...')

Solution (Python):
k = int(input())
s = input()
 
if len(s) <= k:
  print(s)
  
else:
  print(s[:k] + "...")

Solution (Python):
K=int(input())
S=input()
if len(S)<=K:
  print(S)
else:
  print(S[0:K]+'...')

Solution (Python):
s = [input() for i in range(0, 2, 1)]
K_num = int(s[0])
S = s[1]
if K_num >= len(S):
    print(S)
else:
    print(S[:K_num]+"...")

Solution (Python):
K = int(input())
S = str(input())
if len(S)<=K:
    print(S)
elif len(S)>K:
    print(S[0:K]+"...")

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[:k]+'...')

Solution (Python):
def main():
  k = int(input())
  s = str(input())
  w = len(s)
  
  if w<=k:
    print(s)
  else:
    print(s[:k] + '...')
    
main()

Solution (Python):
number = int(input())
word    = input()
answer  =""

if number < len(word):
    answer = word[:number] + "..."
    print(answer)
else:
    print(word)

Solution (Python):
k = int(input())
s = str(input())
if len(s) > k:
  s = s[0:k]
  s += '...'

print(s)

Solution (Python):
size = int(input())
string = input()
if(len(string) <= size):
  print(string)
else:
  print(string[:size] + '...')

Solution (Python):
k = int(input())
s = input()

if len(s) > k:
    print(s[0:k] + '...')
else:
    print(s)

Solution (Python):
k = int(input())
s = input()

if len(s) > k:
    print(s[:k]+"...")
else:
    print(s)

Solution (Python):
k = int(input())
s = str(input())

if len(s) <= k:
    print(s)
    exit()
else:
    print(s[:k] + '...')

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[:k]+'...')

Solution (Python):
K=int(input())
S=input()

N=len(S)

if N<=K:
    print(S)
else:
    SS=S[:K]+"..."
    print(SS)

Solution (Python):
k=int(input())
S=list(input())
if len(S)<=k:
  print("".join(S))
else:
  print("".join(S[0:k]),end="")
  print("...")

Solution (Python):
k = int(input())
a = str(input())
 
if len(a) <= k:
	print(a)
else:
	print(a[:k] + "...")

Solution (Python):
K = int(input())
S = input()

if len(S)>K:
    print(S[:K] + "...")
else:
    print(S)

Solution (Python):
k=int(input())
s=input()
if len(s)>k:
    print(s[:k]+"...")
else:
    print(s)

Solution (Python):
K=int(input())
S=input()
Slist=list(S)

if len(Slist) <= K:
    print(S)
else:
    Slist=Slist[0:K]
    Slist.append("...")
    print(''.join(Slist))

Solution (Python):



import sys


def input():
    return sys.stdin.readline()


def resolve():
    k = int(input())
    s = input().rstrip()

    if k >= len(s):
        print(s)
    else:
        print(s[:k] + "...")


if __name__ == "__main__":
    resolve()

Solution (Python):
k=int(input())
s=input()
t=len(list(s))

n=""
if(t<=k):
    print(s)
else:
    for i in range(k):
        n=n+s[i]
    n=n+"..."
    print(n)

Solution (Python):
K = int(input())
S = input()
SLen = len(S)
if SLen <= K:
    print(S)
else:
    print("{}..." .format(S[0:K]))

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[0:k] + '...')

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[0:k] + '...')

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[:K] + '...')

Solution (Python):
k = int(input())
s = list(map(str, input()))
if len(s) > k:
    for i in range(k):
        print(s[i], end="")
    print("...")
else:
    for i in s:
        print(i, end='')
    print()

Solution (Python):
k=int(input())
s=input()
if k<len(s):
    print(s[:k] +'...')
else:
    print(s)

Solution (Python):


k = int(input())
s = list(input())

rslt = ""

for index in range(k):
    if len(s) <= index:
        break
    rslt += s[index]

if len(s) > k:
    rslt += "..."

print(rslt, flush=True)

Solution (Python):
K = int(input())
S = input()
A = []

if len(S) <= K:
    print(S)
else:
    for i in range(0, K):
        A.append(S[i])
    s = ''.join(A)
    print(s + '...')

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[0:k] + "...")

Solution (Python):
k = int(input())
s = input()

ls = len(s)

if ls<=k:
    print(s)
else:
    km = s[0:k]+'...'
    print(km)

Solution (Python):
K = int(input())
S = input()
if len(S) <= K:
    print(S)
else:
    print(S[:K] + '...')

Solution (Python):
k = int(input())
s = input()

if len(s)<=k: print(s)
else:
    print(s[:k]+'...')

Solution (Python):
K = int(input())
S = input().strip()
if len(S) <= K:
    print(S)
else:
    print(S[:K]+"...")

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[:K]+"...")

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
  print(S)
else:
  print(S[:K] + "...")

Solution (Python):
K = int(input())
S = str(input())

if K >= len(S):
    print(S)

else:
    scut = S[:K]
    print(scut + "...")

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
  print(S)
else:
  print(S[0:K] + '...')

Solution (Python):
k=int(input())
s=input()

if k>=len(s):
	print(s)
else:
	print(s[:k]+'...')

Solution (Python):
K = int(input())
S = input()

s_len = len(S)
if s_len <= K:
    print(S)
else:
    print(S[0:K] + "...")

Solution (Python):


import os
import sys
from io import BytesIO, IOBase
import math 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
 



k=(int)(input())
n=(input())

if(k>=len(n)):
    print(n)
else:
    print(n[0:k],end='')
    print('...')

Solution (Python):
k = int(input())
s = str(input())
if len(s) <= k:
    print(s)
else:
    print(s[:k] + '...')

Solution (Python):
import sys
import numpy as np

lines = sys.stdin.readlines()
a = int(lines[0].strip())
b = lines[1].strip()

if a >= len(b):
  print(b)
else:
  print(''.join(list(b)[:a])+'...')

Solution (Python):
k=int(input())
s=input()
if len(s)<=k:
    print(s)
else:
    s=s[:k]
    s=s+"..."
    print(s)

Solution (Python):
k = int(input())
s = str(input())
len_s = len(s)

if len_s <= k:
    print(s)
else:
    print(s[:k] + '...')

Solution (Python):
K=int(input())
S=str(input())
l=len(S)
if l>K:
    print(S[:K]+"...")
else:
    print(S)

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
  print(S)
else:
  M = S[:K] + '...'
  print(M)

Solution (Python):
def actual(k, s):
    if len(s) > k:
        return f'{s[:k]}...'

    return s

k = int(input())
s = input()

print(actual(k, s))

Solution (Python):
K = int(input())
S = input()
if len(S) <= K:
  print(S)
else:
  print(S[:K]+'...')

Solution (Python):
k=int(input())
s=str(input())

if len(s) <=k:
    print(s)

else:
    c=s[0:k]+ '...'
    print(c)

Solution (Python):
K = int(input())
S = input()
if len(S) <= K:
    print(S)
else:
    print(S[:K]+'...')

Solution (Python):
k = int( input() )
s = str( input() )


l = len( s )


if l <= k:
    print( s )
else:
    s = s[ :k ]
    s = s + "..."
    print( s )

Solution (Python):
K = int(input())
S = input()

S = list(S)
out = []
flag = 0
for i in range(K):
    if i >= len(S):
        flag = 1
        break
    out.append(S[i])


if (i+1 != len(S)) and flag == 0:
    out.append('...')

print(''.join(out))

Solution (Python):
k=int(input())

s=input()

if k>=len(s):
    print(s)
else:
    print(s[:k]+"...")

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)

else:
    print(s[:k] + '...')

Solution (Python):




k = int(input())
s = input()

output = ''

if len(s) <= k:
    output = s
else:
    output = s[:k] + '...'

print(output)

Solution (Python):
K=int(input())
S=str(input())

if len(S)<=K:
  print(S)
else:
  print(S[:K] + '...')

Solution (Python):
k = int(input())
s = input()

palavra = list(s)

if len(s) <= k:
    print(s)

else:
    x = len(palavra)
    while x > k:
        del palavra[x-1]
        x -= 1
    palavra.append("...")
    print("".join(palavra))

Solution (Python):
K = int(input())
S = input()

len = len(S)

if(len <= K):
  print(S)
else:
  S = S[:K]
  S = S + "..."
  print(S)

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[:K] + "...")

Solution (Python):

K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    s = S[:K] + "..."
    print(s)

Solution (Python):
k = int(input())
s = list(input())

if k >= len(s):
    print("".join(s))
else:
    for i in range(len(s)):
        if i == k:
            s[i] = "..."
        elif i > k:
            s[i] = ""
    print("".join(s))

Solution (Python):
K = int(input())
S = input()

print( S if K >= len(S) else S[:K] + "...")

Solution (Python):
k=int(input())
s=input()
if len(s)<=k:print(s)
else:print(s[:k],end="...")

Solution (Python):
k = int(input())
s = input()
 
if len(s) <= k:
	print(s)
else:
 	print(s[0:k] + "...")

Solution (Python):
k = int(input())
s = input()
if len(s) <= k:
  print(s)
else:
  s2 = s[:k] + '...'
  print(s2)

Solution (Python):
K = int(input())
S = input()
l = list(S)

if len(l) > K:
    print(''.join(l[:K])+"...")
    
else :
    print(S)

Solution (Python):
K=int(input())
S=input()
if len(S) <= K:
  print(S)
else:
  ans=S[0:K]
  ans+="..."
  print(ans)

Solution (Python):
k = int(input())
s = list(input())
if(len(s) <= k):
    print("".join(s))
else:
    s = s[0:k]+["..."]
    print("".join(s))

Solution (Python):
k = int(input())
s = input()
 
if len(s) > k:
  print(s[:k] + "...")
else:
  print(s)

Solution (Python):
K = int(input())
S=input()

s=int(len(S))

if K>=s:
    print(S)
else:
    for i in range (K):
        print(S[i],end='')
    print('...')

Solution (Python):
K = int(input())
S = str(input())

if len(S) <= K:
  print(S)
else:
  moji = ''
  for i in range(K):
    moji += S[i]
  moji += '...'
  print(moji)

Solution (Python):
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    K = II()
    S = input()
    Sl = len(S)
    if Sl <= K:
        print(S)
    else:
        ans = S[:K] + "..."
        print(ans)



if __name__ == "__main__":
	main()

Solution (Python):
k=int(input())
s=input()
l=len(s)

if l<=k:
  print(s)
  exit()
else:
  for i in range(k):
    print(s[i],end="")
print('...')

Solution (Python):

 
K = int(input())
S = input()



if ( len(S) <= K ):
  print(S)
  
else:
  print( "{0}...".format( S[:K] ) )

Solution (Python):
K = int(input())
S = input()

if len(S) > K:
  print(S[0:K] + '...')
else:
  print(S)

Solution (Python):
k = int(input())
s = str(input())

if len(s) <= k:
    print(s)
else:
    print(s[0:k] + '...')

Solution (Python):
import sys
input = sys.stdin.readline

K = int(input().rstrip())
S = input().rstrip()

if len(S) <= K:
  print(S)
else:
  print(S[:K] + '...')

Solution (Python):
k = int(input())
n = input()
 
if len(n)<=k:
  print(n)
else:
  print(n[:k] + '...')

Solution (Python):
k = int(input())
s = str(input())

if len(s) <= k:
    print(s)
else:
    print(s[0:k]+'...')

Solution (Python):
import sys
import math
k=int(input())
s=input()

if len(s)<=k:
    print(s)
else:
    s_s=s[:k]
    print(s_s+'...')

Solution (Python):
k = int(input())
s = input()

slen=len(s)
if (k >= slen):
  print (s)
else:
  print (s[0:k]+"...")

Solution (Python):
K=int(input())
S=input()
print(S if len(S)<=K else S[:K]+'...')

Solution (Python):
k=int(input())
s = str(input())
i=len(s)

if i<k+1:
	print(s)
else:
	print(s[0:k]+'...')

Solution (Python):
n = int(input())
s = input()

if len(s) <= n:
    print(s)

else:
    s = s[:n] + "..."
    print(s)

Solution (Python):
k = int(input())
s = input()

if k < len(s):
    s = s[0:k] + "..."

print(s)

Solution (Python):
k = int(input())
s = (input())
if(len(s) <= k):
  print(s)
else:
  ss = s[:k] + '...'
  print(ss)

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[:k]+'...')

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    s = s[:k]
    s += "..."
    print(s)

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[0:K] + "...")

Solution (Python):
K = int(input())
S = str(input())

if len(S) > K:
    print(S[0:K] + '...')
else:
    print(S)

Solution (Python):
K = int(input())
S = str(input())



if len(S)<=K:
  print(S)
else:
  print(S[0:K]+'...')

Solution (Python):
K = int(input())
S = input()

if len(S)<= K:
    print(S)
else:
    print(str(S[0:K]) + '...')

Solution (Python):
K = input()
k = int(K)
S= input()
if len(S) > k:
    print(S[:k] + "...")
else:
    print(S)

Solution (Python):
K=int(input())
S=list(input())
if len(S)<=K:
    print("".join(S))
else:
    ans="".join(S[0:K])
    ans+="..."
    print(ans)

Solution (Python):
K = int(input())
S = input()

if(len(S) <= K):
    print(S)
else:
    print(S[0:K]+"...")

Solution (Python):
k = int(input())
S = str(input())
l = len(S)

if l<= k:
    print(S)
if l>k:
    print(S[:k]+ "...")

Solution (Python):
k = int(input())
s = input()
if len(s)<=k:
    print(s)
else:
    print(s[:k]+"...")

Solution (Python):
K = int(input())
S = input()

if len(S) <= K :
  print(S)
else:
  print(S[:K] + '...')

Solution (Python):
k = int(input())
s = input()
ls = len(s)

if ls <=k:
    print(s)
else:
    print(s[:k]+'...')

Solution (Python):
k=int(input())
s=input()
s1=len(s)
if s1<=k:
    print(s)
else:
    c=s[:k]
    print(str(c)+"...")

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[:K] + '...')

Solution (Python):
k = int(input())
s = str(input())

if len(s) <= k:
  print(s)
elif len(s) > k:
  print(s[:k]+"...")

Solution (Python):
K = int(input())
S = input()

length = len(S)
if length <= K:
    print(S)
else:
    s = S[0:K]
    print('{}...'.format(s))

Solution (Python):
k = int(input())
s = input()
ls = len(s)

if ls <= k:
    print(s)
else :
    print(s[0:k]+"...")

Solution (Python):
k = int(input())
s = input()

ans = ''
plus ='...'
if len(s) <= k:
    print(s)
else:
    for i in range(k):
        ans += s[i]
    ans += plus
    print(ans)

Solution (Python):
K = int(input())
S = str(input())

if K >= len(S):
    print(S)
else:
    print(S[:K]+"...")

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    S = S[0:K]
    S = S + '...'
    print(S)

Solution (Python):
K = int(input())
S = input()

if len(S) > K:
  print(S[:K]+"...")
else:
  print(S)

Solution (Python):
K=input();
K=int(K);
S=input();
if K>=len(S):
  print(S);
else:
  print(S[0:K]+"...")

Solution (Python):
K = int(input())
S = input()
if len(S) <= K:
	print(S)
else:
	print(S[0:K]+"...")

Solution (Python):
k = int(input())
s = input()

if len(s)<=k:
  print(s)
else:
  print(s[:k], end="")
  print("...")

Solution (Python):

K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[:K] + '...')

Solution (Python):
K=int(input())
S=list(input())
if len(S)<=K:
    for s in S:
        print(s,end="")
    print()
    exit()
for i in range(K):
    print(S[i],end="")
print("...")
print()

Solution (Python):
k = int(input())
s = input()
if len(s) <= k:
  print(s)
else:
  ns = s[:k]
  print(ns + "...")

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
  print(S)

else:
  print(S[:K]+"...")

Solution (Python):


K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[:K]+"...")

Solution (Python):
K=int(input())
S=list(input())
if len(S)<=K:
    print("".join(S))
else:
    P=S[:K]
    S="".join(P)
    S+="..."
    print(S)

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[:k] + "...")

Solution (Python):
if __name__ == "__main__":
    K = int(input())
    S = input()
    if len(S) <= K:
        print(S)
    else:
        print(S[:K] + '...')

Solution (Python):
K=input()
S=input()
S=str(S)
C=len(S)

if(int(C)<=int(K)):
  print(S)
else:
  print((S[:int(K)])+"...")

Solution (Python):
K = int(input())
S = input()

len_s = len(S)

if len_s <= K:
    print(S)
else:
    print(S[:K] + '...')

Solution (Python):


k = int(input())
s = input()
if len(s) <= k:
    print(s)
else:
    tmp = s[0:k] + '...'
    print(tmp)

Solution (Python):
k = int(input())
s = str(input())

if len(s) <= k:
    print(s)
else:
    print(s[0:k]+"...")

Solution (Python):
k=int(input())
s=input()
s_l=list(s)

l=len(s_l)
if l<=k:
    print(s)
else:
    for i in range(k):
        print(s_l[i],end='')
    print('...')

Solution (Python):
K=int(input())
S=input()
if len(S) <= K:
    print(S)
else:
    print(S[:K]+'...')

Solution (Python):
K = int(input())
S = input()
if len(S) > K:
    print(S[:K]+'...')
else:
    print(S)

Solution (Python):
K = int(input())
S = (input())
if len(S)<=K:
    print(S)
else:
    print(S[0:K]+'...')

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
  print(s)
else:
  print(s[:k] + "...")

Solution (Python):
K = int(input())
S = input()
 
if len(S) <= K:
    print(S)
else:
    print(S[:K] + '...')

Solution (Python):
k = int(input())
s = input()
if k >= len(s):
    print(s)
else:
    print(s[:k] + "...")

Solution (Python):
K = int(input())
S = input()
n = len(S)
if n <= K:
  print(S)
else:
  print(S[0:K] + "...")

Solution (Python):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
if len(S) > K:
    st = S[:K]
    print(st + '...')

Solution (Python):
k=int(input())
s=input()
if len(s)<=k:
    print(s)
else:
    print(s[0:k]+"...")

Solution (Python):
K=int(input())
N=input()
n=list(N)
if len(n)<=K:
  print(N)
else:
  ans=''.join(n[0:K])
  l=[ans,'...']
  Ans=''.join(l)
  print(Ans)

Solution (Python):
K=int(input())
S=list(map(str,input()))
if len(S)<=K:
  print("".join(map(str,S)))
else:
  print("".join(S[0:K])+"...")

Solution (Python):
K=int(input())
S=input()
if len(S)<=K:
    print(S)
else:
    print(S[0:K]+'...')

Solution (Python):
K = int(input())
S = input()
if K >= len(S):
    print(S)
else:
    print(S[0:K],end="")
    print("...")

Solution (Python):
n=int(input())
s=list(input())
if(len(s)>n):
    l=s[0:n]
    print("".join(l)+"...")
else:
    print("".join(s))

Solution (Python):
k = int(input())
s = input()



if len(s) <= k:
    print(s)
else:
    print(s[0:k] + '...')

Solution (Python):
k = int(input())
s = input()

if (len(s) <= k):
    print(s)
else:
    for i in range(k):
        print(s[i], end='')
    print('...')

Solution (Python):
k = int(input())
s = input()
l = len(s)
if l <= k:
	print(s)
else:
	s = s[:k]
	print(s + "...")

Solution (Python):
k=int(input())
s=list(input())
if len(s) <= k:
  print(''.join(s))
  
else:
  print(''.join(s[:k]) + '...')

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[0:k]+"...")

Solution (Python):
k=int(input())
s=str(input())
print(s[:k]+"..." if len(s)>k else s)

Solution (Python):




k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[:k] + "...")

Solution (Python):
K = int(input())
S = input()

if K < len(S):
	print(S[:K] + '...')
else:
	print(S)

Solution (Python):
K = int(input())
S = input()

if( K >= len(S) ):
    print(S)
else:
    print(S[:K] + "...")

Solution (Python):
k=int(input())
s= input()
if(len(s)<=k):
    print(s)
else:
    print(s[:k]+"...")

Solution (Python):
K = int(input())
S = input()
if len(S)<=K:
  print(S)
else:
  print(S[:K] + "...")

Solution (Python):
K=int(input())
S=input()

if len(S)<=K:
  print(S)
else:
  print(S[:K]+'...')

Solution (Python):
k = int(input())
s = input()
len_s = len(s)

if len_s > k:
    print(s[:k]+"...")
else:
    print(s)

Solution (Python):
K = int(input())
S = list(input())

if len(S) <= K:
    print("".join(S))
else:
    ans = "".join(S[0:K])
    ans = ans + "..."
    print(ans)

Solution (Python):
k = int(input())
s = input()

if len(s) > k:
    print(s[:k] + "...")
else:
    print(s)

Solution (Python):
k=int(input())
s=input()
if(len(s)<=k):
    print(s)
else:
    ns=s[0:k]
    print(ns+'...')

Solution (Python):
k = int(input())
s = input()
if len(s) <= k :
    print(s)
else :
    s = s[:k]+'...'
    print(s)

Solution (Python):
k = int(input())
s = list(input())
if len(s) <= k:
    print("".join(s))
else:
    s = s[:k]
    s.append("...")
    print("".join(s))

Solution (Python):
K = int(input())
S = input()

if (len(S) > K):
    print(S[:K]+"...")
else:
    print(S)

Solution (Python):
from sys import stdin, exit

if __name__ == '__main__':
    k = int(input())
    s = input()
    print(s[0:k], end="")
    if (k<len(s)):
        print("...")

Solution (Python):
l = int(input())
s = input()

if len(s) <= l:
  print(s)
else:
  print(s[:l]+'...')

Solution (Python):

import sys
input = sys.stdin.readline
K = int(input())
S =input().strip()
l =len(S)
if l <= K:
    print(S)
else:
    print(S[:K]+"...")

Solution (Python):
K=int(input())
S=input()
if len(S)<=K:
  print(S)
else:
  retu=S[:K]+"..."
  print(retu)

Solution (Python):
K = int(input())
S = input()

S_count = len(S)

if S_count > K:
  print(S[:K] + '...')
else:
  print(S)

Solution (Python):
def test(k, s):
  if len(s) <= k:
    print(s)
  else:
    print(s[0:k:1] + '...')

test(int(input()), input())

Solution (Python):
K=int(input())
S=input()
LEN=len(S)
if LEN<=K:
  print(S)
else:
  print(S[:K]+"...")

Solution (Python):
K = int(input())
S = input()
if len(S) > K:
    S = S[:K] + '...'
print(S)

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
  print(s)
else:
  print(s[:k] + '...')

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print(s[:k] + "...")

Solution (Python):
K = int(input())
S = input()

if len(S) > K:
    print("{}...".format(S[:K]))
else:
    print(S)

Solution (Python):
def main():
    K = int(input())
    S = input()

    if len(S) <= K:
        print(S)
    else:
        print(f"{S[:K]}...")


if __name__ == "__main__":
    main()

Solution (Python):
def Int():
    return int(input())
def Ints():
    return map(int,input().split())
def IntList():
    return list(Ints())
def IntMat(N):
    return [IntList() for i in range(N)]

import sys
sys.setrecursionlimit(4100000)
rl = sys.stdin.readline

K = Int()
S = input()

if len(S) <= K:
    print(S)
else:
    ans = ''
    c = 0
    for i in S:
        if c < K:
            ans += i
        else:
            break
        c += 1
    print(ans+'...')

Solution (Python):









import os
import sys




def main():
    k = int(input())
    s = input()
    if k<len(s):
        print("{}...".format(s[:k]))
    else:
        print(s)

if __name__ == "__main__":
    main()

Solution (Python):
k = int(input())
s = str(input())
if len(s) <= k:
	print(s)
else:
	print(s[0:k] +"...")

Solution (Python):
K = int(input())
S = input()
slen = len(S)

if slen <= K:
    print(S)
else:
    print(S[0:K] + '...')

Solution (Python):
k=int(input())
s=list(input())
if len(s)<=k:
    print(''.join(s))
else:
    for i in range(k):
        print(s[i],end='')
    print('...')

Solution (Python):
K = int(input())
S = input()
if K < len(S):
    print(S[0:K]+"...")
else:
    print(S)

Solution (Python):
K = int(input())
S = input()

len_s = len(S)

if len_s > K:
    S = S[0:K] + '...'

print(S)

Solution (Python):
k = int(input())
s = input()
if len(s)<= k:
    print(s)
if k < len(s):
    s = s[:k] + "..."
    print(s)

Solution (Python):
k = int(input())
s = input()
if len(s) <= k:
  print(s)
else:
  print(s[0:k] + "...")

Solution (Python):
K = int(input())
S = input()

if( K >= len(S) ):
    print(S)
else:
    print(S[:K] + "...")

Solution (Python):
k=int(input())
s=input()




if len(s)>k:
    print(s[0:k],'...',sep='')

else:
    print(s)

Solution (Python):
k = int(input())
s = input()
if(len(s)<=k):
  print(s)
else:
  print("{}...".format(s[:k]))

Solution (Python):
N = int(input())
S = input()




if N < len(S):
  print(S[:N] + "...")
else:
  print(S)

Solution (Python):
k = int(input())
s = list(input())
if len(s) > k:
    for i in range(len(s) - k):
        s.pop()
    ss = "".join(s)
    ss += "..."
    print(ss)
else:
    print("".join(s))

Solution (Python):
K = int(input())
S = str(input())
if len(S) <= K:
    print(S[:K])
elif len(S) > K:
    print(S[:K] + ("." * 3))

Solution (Python):
K = int(input())
S = input()
if len(S) <= K:
    print(S)
else:
    print(S[:K]+"...")

Solution (Python):
k = int(input())
s = input()
print(s[:k] + '...' if len(s) > k else s)

Solution (Python):
k = int(input())

s = input()

if len(s) <= k:
    print(s)
else:
    for i in range(k):
        print(s[i],end='')
    print('...')

Solution (Python):
k=int(input())
s=input()

if(k>= len(s)):
    print(s)

elif(k < len(s)):
    s_list=list(s)
    out=s[:k]
    
    for c in out:
        print(c, end='')

    print('...', end='')

Solution (Python):
k = int(input())
s = input()

if len(s) <= k:
    print(s)
else:
    print('{}{}'.format(s[:k],'...'))

Solution (Python):
K = int(input())
S = input()
ans= S
if len(S) > K:
  ans = S[0:K] + "..."
print(ans)

Solution (Python):
K = int(input())
S = input()
if len(S) <= K:
    print(S)
else:
    print(S[:K] + '...')

Solution (Python):
n=int(input())
s=input()
l=len(s)
if(n >= l):
    print(s)
else:
    print(s[0:n]+"...")