include <bits/stdc++.h>

using namespace std;

void solve(){ string word; cin >> word; unordered_set s; int count = 0; for(int i = 0; i < word.size() and word[i] != '\0'; i++){ //check if x is already not in set s! if(s.find(word[i]) != s.end()){ s.insert(word[i]); count++; } //otherwise, it's a character we already saw before! } //check for parity! if(count % 2 == 0){ cout << "CHAT WITH HER!"; return; } else{ cout << "IGNORE HIM!"; return; } } int main(){ solve(); }