AT_abc398_a [ABC398A] Doors in the Center

Find a length- $ N $ string that satisfies all of the following conditions: - Each character is `-` or `=`. - It is a palindrome. - It contains exactly one or exactly two `=`s. If it contains two `=`s, they are adjacent. Such a string is unique.

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

Print the answer.

### Constraints - $ 1 \leq N \leq 100 $ - $ N $ is an integer.