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 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {

//	入力の読み込み
		Scanner sc = new Scanner(System.in);
		int K = sc.nextInt();
		String S = sc.next();

//		パターン1（SとKを比べて場合分け）
//		if(S.length() <= K) {
//			System.out.print(S);
//		}
//		else {
//			System.out.print(S.substring(0,K) + "...");
//		}

//	パターン2（Kまで1文字ずつ表示）
		if(K <= S.length()) {
			for(int i=0 ; i<K ; i++) {
				System.out.print(S.charAt(i));
			}
			System.out.print("...");
			return;
		}
		else {
			System.out.print(S + "...");
		}
	}
}