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 C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>

int compare(const void *a, const void *b)
{
	int A = *((int*)a);
	int B = *((int*)b);
	
	return A-B;
}


int main()
{
	//変数宣言
	int K;
	char S[1000];
	
	int i;
	
	//初期入力
	scanf("%d",&K);
	scanf("%s",S);
	
	for(i=0;i<K;i++)
	{
		printf("%c",S[i]);
		if(S[i+1] == '\0')
		{
			break;
		}
	}
	
	if(S[i+1]!='\0'){
		printf("...");
	}
	
	return 0;
}