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.*;
class Main{
    public static void main(String[]args){
        Scanner scanner = new Scanner(System.in);
        int K = scanner.nextInt();
        String S = scanner.next();
        char[] split_S = new char [S.length()];
        for(int i=0;i<S.length();i++){
            split_S[i] = S.charAt(i);
        }
        if(S.length() <= K){
            for(int i=0;i<S.length();i++){
                if(i != i-1){
                    System.out.print(split_S[i]);
                }
                else{
                    System.out.println(split_S[i]);
                }
            }
        }
        else{
            for(int i=0;i<S.length();i++){
                if(i != K-1){
                    System.out.print(split_S[i]);
                }
                else{
                    System.out.println(split_S[i]+"...");
                    break;
                }
            }
        }

        scanner.close();
    }
}