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-----
7
nikoandsolstice

-----Sample Output-----
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....

Difficulty: EASY

Solutions:
K = int(input())
S = str(input())
if K >= len(S):
	print(S)
else:
	print(S[0:K] + '...')


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


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


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


k = int(input())
s = input()
print(s[:k] + '{0}'.format('...' * (len(s) > k)))


K = int(input())
S = input()
print(S[0:K] + '...' * int(len(S) > K))


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


import sys, os.path
sys.setrecursionlimit(10 ** 5)

def mod():
	return 10 ** 9 + 7

def i():
	return sys.stdin.readline().strip()

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

def li():
	return list(sys.stdin.readline().strip())

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

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

def solve():
	k = ii()
	s = i()
	if len(list(s)) <= k:
		print(s)
	else:
		print(s[:k] + '...')
for _ in range(1):
	solve()


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


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


(k, s) = open(0)
k = int(k)
print(s[:k] + '...' * (-~k < len(s)))


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


a = int(input())
b = input()
if len(b) <= a:
	print(b)
else:
	print(b[:a] + '...')


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


integer = int(input())
string = input()
if len(string) > integer:
	print(string[:integer] + '...')
else:
	print(string)


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


k = int(input())
s = input()
l = len(s)
print(s[0:min(k, l)] + '.' * 3 * (k < l))


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, bisect
import sys
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
mod = 10 ** 9 + 7
stdin = sys.stdin
ni = lambda : int(ns())
nf = lambda : float(ns())
na = lambda : list(map(int, stdin.readline().split()))
nb = lambda : list(map(float, stdin.readline().split()))
ns = lambda : stdin.readline().rstrip()
K = ni()
S = ns()
if len(S) <= K:
	print(S)
else:
	print(S[:K] + '...')


def i_input():
	return int(input())

def i_map():
	return map(int, input().split())

def i_list():
	return list(map(int, input().split()))

def i_row(N):
	return [int(input()) for _ in range(N)]

def i_row_list(N):
	return [list(map(int, input().split())) for _ in range(N)]
k = i_input()
s = input()
if len(s) <= k:
	print(s)
else:
	print(s[0:k] + '...')


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


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


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


from collections import Counter
import sys
sys.setrecursionlimit(10 ** 6)
mod = 1000000007
inf = int(1e+18)

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


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


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


N = int(input())
s = input()
if len(s) > N:
	s = s[:N] + '...'
print(s)


k = int(input())
s = input()
x = s[:k] + '...' * (len(s) > k)
print(x)


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


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


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


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


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


N = int(input())
A = input()
if len(A) > N:
	print(A[:N] + '...')
else:
	print(A)


k = int(input())
s = input()
print(s) if len(s) <= k else print(f'{s[:k]}...')


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


(k, s) = open(0).read().split()
print(s if len(s) <= int(k) else s[:int(k)] + '...')


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


K = int(input())
S = input()
W = S[:K]
if W == S:
	print(S)
else:
	print(W + '...')


k = int(input())
s = input()
print(s[:k] + '.' * 3 * (len(s) > k))


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


k = int(input())
s = str(input())
n = len(s) - k
print(s[:k] + '...' if n > 0 else s)