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 Java (OpenJDK 11.0.6) (judge verdict: Runtime Error)

import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Scanner sc1= new Scanner(System.in);
		 int K = sc.nextInt();
		 String S = sc1.next();
		 //Pattern p = Pattern.compile("^[^a-z]*$");
		 Pattern p = Pattern.compile("^[a-z]*$");
		 Matcher m = p.matcher(S);
		 boolean b = m.find();

		 //文字が英字かどうか
		 if(b){
			 if(1<=K && K<=100) {

				 if(1<=S.length() && S.length()<=100) {

					 if(S.length() >= K) {

						 System.out.println(S.substring(0,K)+ "...");
					 }
					 else if(S.length() <= K) {

						 System.out.println(S);
					 }

				 }
			 }
		 }
		 sc.close();
		 sc1.close();
	}
}