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 in Ruby (2.7.1) (judge verdict: Accepted)

#N = gets.to_i               # 単一整数
#a = gets.split.map(&:to_i)  # スペースで区切られた複数の整数
#a = N.times.map{gets.to_i}  # 縦に並んだ複数の整数。たまにある
#S = gets.chomp              # 文字列。chompを付けないと改行文字がついてくる

def solve168A(n)
  last_n = n % 10
  if last_n == 3
    puts ('bon')
  elsif last_n == 2 or last_n == 4 \
    or last_n == 5 or last_n == 7 or last_n == 9
    puts ('hon')
  else
    puts ('pon')
  end
end

def soleve168B(k,s)
  if s.length > k 
    first_x_char = s[0..k-1]
    puts (first_x_char + '...')
  else
    puts (s)
  end
end

=begin
N = gets.to_i
solve168A(N)
=end

K = gets.to_i
S = gets.chomp
soleve168B(K,S)