#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long int mod = 1000000007;
void print() { cout << endl; }
void printarray() { return; }
void scan() { return; }
template <typename T, typename... Args>
void print(T a, Args... arg) {
  cout << a << " ";
  print(arg...);
}
template <typename T, typename... Args>
void scan(T &a, Args &...arg) {
  cin >> a;
  scan(arg...);
}
template <typename T, typename... Args>
void scan(vector<T> &v, Args &...arg) {
  for (auto &i : v) cin >> i;
  scan(arg...);
}
template <typename T, typename... Args>
void printarray(vector<T> &v, Args &...arg) {
  for (auto i : v) cout << i << " ";
  cout << endl;
  printarray(arg...);
}
long long int isPrime(long long int x) {
  for (long long int i = 2; i <= x / 2; i++) {
    if (x % i == 0) {
      return 0;
    }
  }
  return 1;
}
long long int binaryToDecimal(long long int n) {
  long long int num = n;
  long long int dec_value = 0;
  long long int base = 1;
  long long int temp = num;
  while (temp) {
    long long int last_digit = temp % 10;
    temp = temp / 10;
    dec_value += last_digit * base;
    base = base * 2;
  }
  return dec_value;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return a * b / gcd(a, b);
}
void solve() {
  long long int n;
  cin >> n;
  for (long long int i = 0; i < n; i++) {
    if (i % 2 == 0) {
      cout << "I hate ";
    } else if (i % 2 == 1) {
      cout << "I love ";
    }
    if (i < n - 1) {
      cout << "that ";
    } else if (i == n - 1) {
      cout << "it";
    }
  }
  cout << "\n";
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
