Problem Description

You are given a string $ S $ consisting only of lowercase English letters and a maximum length $ L $ to display.

If the length of $ S $ is greater than $ L $, output only the first $ L $ characters. Otherwise, output $ S $ as it is.

Input Format

The input is given from the standard input in the following format:

$ L $ $ S $

Output Format

Output the processed string.

Sample Input and Output

Sample Input #1

10
hello

Sample Output #1

hello

Sample Input #2

37
narasenntannkagakugijyutudaigakuinndaigaku

Sample Output #2

narasenntannkagakugijyutudaigakuinnda

Notes/Hints

Story

Thank you for participating in NJPC.

The full name of NJPC is "Nara institute of science and technology & Japan advanced institute of science and technology Programming Contest", which is unfortunately too long.

We would like you to create a program that displays only the first $ L $ characters of a too long string.

Constraints

• $ 1≦L,|S|≦10^5 $
• $ L $ is an integer
• $ S $ consists only of lowercase English letters

见题面 Input 部分

见题面 Output 部分