您的位置:首页 > 其它

Codeforces #366(Div.2)A.Hulk【水题】

2016-08-08 08:19 459 查看
A. Hulk

time limit per test
1 second

memory limit per test
256 megabytes

input
standard input

output
standard output

Dr. Bruce Banner hates his enemies (like others don't). As we all know, he can barely talk when he turns into the incredible Hulk. That's why he asked you to help him to express his feelings.

Hulk likes the Inception so much, and like that his feelings are complicated. They have n layers. The first layer is hate, second one
is love, third one is hate and so on...

For example if n = 1, then his feeling is "I
hate it" or if n = 2 it's "I
hate that I love it", and if n = 3 it's "I
hate that I love that I hate it" and so on.

Please help Dr. Banner.

Input

The only line of the input contains a single integer n (1 ≤ n ≤ 100) —
the number of layers of love and hate.

Output

Print Dr.Banner's feeling in one line.

Examples

input
1


output
I hate it


input
2


output
I hate that I love it


input
3


output
I hate that I love that I hate it


题目大意:给你一个数n,输出其循环语句。

Ac代码:

#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
{
printf("I ");
if(i%2==0)
printf("hate ");
else printf("love ");
if(i==n-1)
{
continue;
}
printf("that ");
}
printf("it\n");
}
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  Codeforces #366Div.2