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: Accepted)

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int d = s.nextInt();
        // int  a = d % 10;

        // if(a == 3) {
        //     System.out.println("bon");
        // } else if( a== 0 || a == 1 || a == 6 || a == 8) {
        //     System.out.println("pon");
        // } else {
        //     System.out.println("hon");
        // }
        String str = s.next();
        char c[] = str.toCharArray();
        if(c.length>d) {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < d; i++) {
                sb.append(c[i]);
            }
            sb.append("...");
            System.out.println(sb.toString());
        } else {
            System.out.println(str);
        }
    }
}