Under construction

Still being built. Things may change

SciComLove (2024)

Time limit1sMemory limit1024 MB

Summary
Given N, print the string SciComLove reversed N times: the original if N is even, or evoLmoCciS if N is odd.
Level

Easy1 of 10

Topics
Math, Implementation
Solved
No attempts yet

Problem

Minkyu's favorite string is "SciComLove" (without the quotes). Recently Minkyu learned how to reverse a string. Reversing a string once means changing it by the following process.

  • Reversing a string A=A1A2⋯AsA=A_1A_2\cdots A_s of length ss once gives the string BB, which is AA read backwards from its right end, that is, AsAs−1⋯A1A_sA_{s-1}\cdots A_1.

Minkyu went further and came up with the following method for reversing a string NN times.

  • When N≥2N\ge 2, the string from reversing AA NN times is the string from reversing the result of reversing AA N−1N-1 times, once more.

Using this method, Minkyu wanted to find the string obtained by reversing "SciComLove" NN times, but once NN grew too large, he could not. Write a program that finds the string obtained by reversing "SciComLove" NN times on Minkyu's behalf.

Input

The first line contains an integer NN.

Output

Print the string obtained by reversing "SciComLove" NN times. Do not print the quotes.

Constraints

  • 1≤N≤1091\le N\le 10^9

Examples2

  1. Example 1

    Input
    1
    
    Expected output
    evoLmoCicS
    
  2. Example 2

    Input
    2
    
    Expected output
    SciComLove