Alternate Stall Decoration

You are given an integer n representing the number of stalls. Your goal is to generate a decoration sequence for the stalls such that no two consecutive stalls have the same decoration. The decoration sequence should consist of characters 'x' and 'o' in alternation. Specifically, the first stall is decorated with 'x', and then the decorations alternate. In formal terms, for each index \(i\) (0-indexed) in the sequence, the character is defined as:

\( \text{char}_i = \begin{cases} x, & \text{if } i \bmod 2 = 0 \\ o, & \text{if } i \bmod 2 = 1 \end{cases} \)

print the sequence as a single string of length n.

inputFormat

The input consists of a single line containing one integer n (1 \(\leq\) n \(\leq\) 10⁵), representing the number of stalls.

outputFormat

Output a single line containing the decoration sequence of length n, where the pattern alternates between 'x' and 'o', starting with 'x'.

## sample

5

xoxox

</p>