AT_abc436_a [ABC436A] o-padding

You are given an integer $ N $ and a string $ S $ consisting of lowercase English letters with length **less than** $ N $ . Print the string obtained by repeatedly adding the lowercase English letter `o` to the beginning of $ S $ until its length becomes $ N $ .

The input is given from Standard Input in the following format: > $ N $ $ S $

Print the answer.

### Sample Explanation 1 Since $ N=5 $ and the length of $ S $ is $ 3 $ , the answer is the string obtained by adding $ 5-3=2 $ `o`s to the beginning of $ S $ . ### Constraints - $ 2\leq N \leq 100 $ - $ N $ is an integer. - $ S $ is a string consisting of lowercase English letters with length between $ 1 $ and $ N - 1 $ , inclusive.