5575: Penalty Kick点球大战(ABC348A)

内存限制:1024 MB 时间限制:2.000 S
评测方式:文本比较 命题人:
提交:0 解决:0

题目描述

 Problem Statement:

Xiaoniu will have $N$ penalty kicks in a soccer match.

For the $i$-th penalty kick, he will fail if $i$ is a multiple of $3$, and succeed otherwise.

Print the results of his penalty kicks.

小牛将在足球比赛中进行N次点球。对于第i次点球,如果i3的倍数,他将失败,否则他将成功。请输出他的点球结果。


输入

N

输出


Print a string of length $N$ representing the results of Xiaoniu's penalty kicks. The $i$-th character $(1 \leq i \leq N)$ should be `o` if Xiaoniu succeeds in the $i$-th penalty kick, and `x` if he fails.

输出一个长度为N的字符串,表示小牛的点球结果。第i个字符1iN如果小牛在第i次点球中成功,应为o,如果失败,应为x

样例输入 复制

7

样例输出 复制

ooxooxo

提示

Constraints:

-   $1 \leq N \leq 100$
-   All inputs are integers.

来源/分类