Codeforces Round #366 (Div. 2) A

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

题意：水题

题解：取模输出

 /******************************
 code by drizzle
 blog: www.cnblogs.com/hsd-/
 ^ ^    ^ ^
  O      O
 ******************************/
 //#include<bits/stdc++.h>
 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<map>
 #include<algorithm>
 #include<queue>
 #include<cmath>
 #define ll __int64
 #define PI acos(-1.0)
 #define mod 1000000007
 using namespace std;
 int n;
 int main()
 {
     scanf("%d",&n);
     for(int i=;i<=n;i++)
     {
         if(i%==)
             cout<<"I hate";
         if(i%==)
             cout<<"I love";
         if(i!=n)
             cout<<" that ";
         if(i==n)
             cout<<" it"<<endl;
     }
     return ;
 }