Noob's Problem

2.3

3 votes
Very-Easy
Problem

Killjee the Noob is stuck at most basic question of Algorithms Cup. Now, he is seeking your help.

You need to find lexicographically largest palindromic string of n letters, which contains lowercase english alphabets only .

INPUT CONSTRAINTS

1n106

INPUT FORMAT

Input contains a single integer n.

OUTPUT FORMAT Output a single string as described in the problem.

Time Limit: 1
Memory Limit: 256
Source Limit:
Explanation

Killjee is so noob that he hasn't understood the samples yet.

Editor Image

?