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# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;
using System.Text;
using System.Numerics;

namespace abc168
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
            if (File.Exists("input.txt"))
            {
                Console.SetIn(new StreamReader("input.txt"));
            }
            solve_abc168B();
            Console.Out.Flush();
        }

        public static void solve_abc168B()
        {
            int k = Convert.ToInt32(Console.ReadLine());
            string s = Console.ReadLine();
            if (s.Length > k)
            {
                Console.WriteLine(s.Substring(0, k) + "...");
            }
            else
            {
                Console.WriteLine(s);
            }

        }

        public static void solve_abc168A()
        {
            string hon = "24579";
            string pon = "0168";
            string n = Console.ReadLine();
            if (hon.Contains(n.Substring(n.Length - 1, 1)))
            {
                Console.WriteLine("hon");
            }
            else if (pon.Contains(n.Substring(n.Length - 1, 1)))
            {
                Console.WriteLine("pon");
            }
            else
            {
                Console.WriteLine("bon");
            }
        }
        
        public static int binSearchLeft(int[] a, int x)
        {
            int l = 0;
            int r = a.Length - 1;
            while (r - l > 1)
            {
                int m = (r + l) / 2;
                if (a[m] < x)
                {
                    l = m + 1;
                }
                else
                {
                    r = m;
                }
            }
            return l;
        }        
    }
}