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):
k = int(input())
s = input()
ans = ''
if len(s) > k:
    for i in range(k):
        ans += s[i]
    
    ans += '...'
    print(ans)
else:
    print(s)

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

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

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

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

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

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

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

print(S[0:K]+'...')

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

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

print(s)

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

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):
N = int(input())
S = list(input())
s = len(S)
m = "..."
if s<=N:
    print(''.join(S))
else:
    k = ''.join(S[:N])
    print(k+m )

Solution (Python):
k=int(input())
s=input()
if len(s)>k:
    t=s[:k]+str('...')
    print(t)
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],'...',sep='')

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 = input()
    if len(S) <= K:
        print(S)
    else:
        print(S[:K] + "...")

if __name__ == "__main__":
    main()

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

Solution (Python):
K=int(input())
S=input()
length=len(S)
if length<=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())
s = input()
s_len = len(s)
if s_len <= k:
    print(s)
else:
    print(s[0:k]+"...")

Solution (Python):
import sys
def I(): return int(sys.stdin.readline().rstrip())
def S(): return sys.stdin.readline().rstrip()
K = I()
S = S()
ans = S[:K]
if len(S)>K:
    ans += '...'
print(ans)

Solution (Python):
import sys, random, math
from bisect import bisect_left, bisect_right
input = sys.stdin.readline

def main():
    inf = 10 ** 20



    t = 1
    
    for _ in range(1, t+1):
    
        
        k = int(input())
        s = input().strip()
        if(k < len(s)):
            print(s[:k] + '...')
        else:
            print(s)
        
        
        
main()

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

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

Solution (Python):
from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

k = ii()
s = input()

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

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

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

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)
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()
if len(s)>k:
    print(s[:k] + '...')
else:
    print(s)

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

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

Solution (Python):
import sys

input = sys.stdin.readline

def main():
    K = int(input())
    S = input().rstrip('\n')
    if len(S) > K:
        print(S[:K]+'...')
    else:
        print(S)

if __name__ == '__main__':
    main()

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):
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[0:K]+"...")

Solution (Python):
k = int(input())
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:
  print("".join(S[:K])+"...")

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

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 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[: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 = 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[:k]+ '...')

Solution (Python):

K=int(input())
S=input()
printwords=S[:K]
if len(S) > K:
  printwords+="..."
print(printwords)

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

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 len(s)<=k:
    print(s)
else:
    print(s[:k]+"...")

Solution (Python):

def main():
    K = int(input())
    S = input()
    if len(S) > K:
        S = S[:K] + '...'

    print(S)


if __name__ == '__main__':
    main()

Solution (Python):
k = int(input())
s = str(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:
    ans = s[:k] + "..."
    print(ans)

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

Solution (Python):
'''
.append(要素) リストに要素を追加
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
from functools import reduce
from operator import mul
from collections import Counter
import itertools
import fractions
import sys

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

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

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

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

leng = len(s)
amari = leng - k
ans = s[:k]

if amari > 0:
    ans += '...'
    print(ans)
else:
    print(ans)

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

l = len(S)

if l <= 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 len(s) > k:
  print(s[:k] + '...')
else:
  print(s)

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

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

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

Solution (Python):

from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce


MOD = 1000000007

def keta(kazu):
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def combination(m,n):
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

def main():
    a = int(stdin.readline().rstrip())
    s = stdin.readline().rstrip()
    
    if len(s) <= a:
        print(s)
    else:
        print(s[0:a] + '...')
        
main()

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 = input()
    lens = len(S)

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


if __name__ == '__main__':
    main()

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()

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

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

if __name__=='__main__':
    main()

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)
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=str(input())

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

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

Solution (Python):




import sys
input = sys.stdin.readline



def main():
    K = int(input())
    S = input().rstrip()

    if K >= len(S):
        res = S
    else:
        res = S[:K] + '...'

    print(res)



main()

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

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

    print(S + "...")

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

if len(S)<=K:
    print(S)
else:
    for i in range(K):
        print(A[i],sep="",end="")
    print("...")

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

Solution (Python):
def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

K = intinp()
S = input()

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:
    print(S[:K] + "...")

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

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


k = int(input())
s = input()
task(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 = input()
if k >= len(s):
  print(s)
else:
  ans = s[:k]
  print(ans + '...')

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

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

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:
    ans=S
else:
    ans=S[:K]+"..."

print(ans)

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

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

Solution (Python):
import sys
import numpy as np


def inputs(func=lambda x: x, sep=None, maxsplit=-1):
	return map(func, sys.stdin.readline().split(sep=sep, maxsplit=maxsplit))

def input_row(n : int, type=np.int, **kwargs):
	return np.fromiter(inputs(type, **kwargs), dtype=type)

def input_2d(nrows : int, ncols : int, type=np.int, **kwargs):
	data = np.zeros((nrows, ncols), dtype=type)
	for i in range(nrows):
		data[i, :] = input_row(ncols, type, **kwargs)
	return data


K, = inputs(int)
S = input()

if len(S) <= K:
	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()
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[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()
s_list = list(s)
if len(s_list) <= k:
    print(s)
else:
    s_k = ''.join(s_list[0:k])
    print(s_k + '...')

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

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

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

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()

SL=len(S)

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

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()

mylen = len(S)

if mylen <= 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()

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

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

Solution (Python):
K = int(input())
S = input()
if len(S) > K:
    result = f"{S[:K]}..."
else:
    result = S
print(result)

Solution (Python):




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


if len(s) <= k:
    ans = s
else:
    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):
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):
import sys
from collections import deque
import bisect
import math
import itertools
from queue import deque
from math import gcd

INF = float('inf')
mod = 10**9+7
eps = 10**-7


def inp(): return int(sys.stdin.readline())


def inp_list(): return list(map(int, sys.stdin.readline().split()))


def lcm(x, y): return (x * y) // gcd(x, y)


K = inp()
S = input()

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

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

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

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

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

length = len(s)

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

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

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[0:k] + '...')
else:
    print(s)

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

Solution (Python):
import sys

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

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

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()

l = len(s)

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

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

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

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

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

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

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

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

s = input()

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

Solution (Python):
import sys
import math
from collections import Counter
import itertools
import fractions



def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())

def LI(): return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'


p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")



K=II()
S=SR()

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

Solution (Python):
N = int(input())
s = input()
l = list(s)
if len(l) <= N:
    print(s)
else:
    ans = ""
    for i in range(N):
        ans += l[i]
    ans += "..."
    print(ans)

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict

def main():
    n = int(sys.stdin.readline())
    k = input()
    if len(k) > n:
        print(k[:n],end="")
        print("...")
    else: print(k)
    return 0

if __name__ == "__main__":
    main()

Solution (Python):
def main():
    from sys import stdin
    k = int(stdin.readline().rstrip())
    s = stdin.readline().rstrip()
    if len(s)<=k:
        print(s)
    else:
        ans = s[:k]+"..."
        print(ans)
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()

s = len(S)

if 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()
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 = str(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[:k] + "...")
else:
    print(s)

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

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

Solution (Python):

def q2():
    K = int(input())
    S = input()
    
    if len(S) <= K:
        print(S)
        return

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

q2()

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):
a=int(input())
b=input()
if len(b)>a:
    print(b[0:a]+'...')
else:
    print(b)

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:
    S = S[:K]
    S.append('...')
    print(''.join(S))

Solution (Python):
K = int(input())
S = list(input())
etc = ["..."]

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

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

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

Solution (Python):


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


if __name__ == '__main__':
    solve()

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

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

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:
    s = ""
    for i in range(K):
        s += S[i]
    print(s + "...")

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

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

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

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

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

Solution (Python):
K = eval(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:
	print('%s...' %(s[:k]))

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

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[0:K]+'...')
else:print(S)

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

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

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
   
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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:
  for i in range(K):
    print(s[i], end="")
  print("...")

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

if len(s) <= k: exit(print(s))
j = len(s) - 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):





















MOD = 10**9 + 7
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):

import sys
import numpy as np


def solve(K: int, S: str):
    if len(S)>K:
        print(S[:K]+"...")
    else:
        print(S)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  
    S = next(tokens)  
    solve(K, S)

if __name__ == '__main__':
    main()

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()

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

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

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

if __name__=="__main__":
    main()

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())

n = input()

l = len(n)

if l>k:
    print(str(n[:k]),end = "")
    print("...")
else:
    print(str(n))

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

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

if l <=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):
K = int(input())
S = input()

t = ''
if len(S) > K:
    t = '...'

print(S[:K] + t)

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[:K] + "...")

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()
a=""
if k<len(s):
    a+=s[0:k]
    a+="..."
    print(a)
else:
    print(s)

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

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:
    ans = ''
    for i in range(len(S)):
        ans += S[i]
else:
    ans = ''
    for i in range(K):
        ans += S[i]
    ans += '...'

print(ans)

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

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[0:K]+'...')
else :
    print(S)

Solution (Python):
import sys
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

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], '...', sep='')

Solution (Python):
def dots(k, s):
  if(len(s)<=k):
    return s
  else:
    return s[:k]+'...'

k = int(input())
s = input()
print(dots(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=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):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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()
N = len(S)

if N > 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 len(s) > k:
    print(s[:k] + "...")
else:
    print(s)

Solution (Python):

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

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

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):
K = int(input())
S = input()
l = len(S)
s = list(S)
if l <= K:
  print(S)
else:
  print("".join(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()

n = len(s)

if n <= 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):
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 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[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=input()
if len(s)<=n:
    print(s)
else:
    print(s[:n]+'...')

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 k < len(s):
    print(s[:k]+"...")
else:
    print(s)

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

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

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

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