#include <bits/stdc++.h>
void Merge(char A[], int left, int Right, int mid) {
  int n1, n2, i, j, k;
  n1 = mid - left + 1;
  n2 = Right - mid;
  char L[n1], R[n2];
  for (i = 0; i < n1; i++) {
    L[i] = A[left + i];
  }
  for (j = 0; j < n2; j++) {
    R[j] = A[mid + 1 + j];
  }
  i = 0;
  j = 0;
  k = left;
  while (i < n1 & j < n2) {
    if (L[i] <= R[j]) {
      A[k] = L[i];
      i++;
    } else {
      A[k] = R[j];
      j++;
    }
    k++;
  }
  while (i < n1) {
    A[k] = L[i];
    i++;
    k++;
  }
  while (j < n2) {
    A[k] = R[j];
    j++;
    k++;
  }
}
void Mergesort(char A[], int left, int Right) {
  int mid;
  if (left < Right) {
    mid = (left + Right) / 2;
    Mergesort(A, left, mid);
    Mergesort(A, mid + 1, Right);
    Merge(A, left, Right, mid);
  }
}
int main() {
  char ch[101];
  scanf("%s", &ch);
  int n, count = 0, i;
  n = strlen(ch);
  Mergesort(ch, 0, n - 1);
  for (i = 0; i < n; i++) {
    if (ch[i] != ch[i + 1]) count++;
  }
  if (count % 2 == 1)
    printf("IGNORE HIM!\n");
  else
    printf("CHAT WITH HER!\n");
  return 0;
}
