Algorithm


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
Copy
1
output
Copy
I hate it
input
Copy
2
output
Copy
I hate that I love it
input
Copy
3
output
Copy
I hate that I love that I hate it

 



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <iostream>
#include <string>

using namespace std;

int main() {
	int n;
	cin >> n;
	string s = "";
	for(int i = 1; i < n; i++) i % 2 == 0 ? s += "I love that " : s += "I hate that ";
	n % 2 == 0 ? s += "I love it" : s += "I hate it";
	cout << s << endl;

	return 0;
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
1

Output

x
+
cmd
I hate it
Advertisements

Demonstration


Codeforces Solution-Hulk-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+