Arrange Trees

Given an integer \( n \), generate a string of \( n \) characters representing a row of trees. Each character must be one of the three types: 'O', 'P', or 'M'. The trees should be arranged in a cyclic order: 'O', 'P', 'M', and then repeating, ensuring that no two adjacent trees are of the same type. For example, if \( n = 4 \), the output should be "OPMO".

inputFormat

Input is provided via standard input. It consists of a single integer \( n \) (\( 1 \leq n \leq 100 \)), which represents the number of trees to arrange.

outputFormat

Output the arranged string of trees to standard output. The output string must be of length \( n \) and follow the cyclic pattern 'O', 'P', 'M' ensuring that no two adjacent characters are identical.

4

OPMO