7 7 7
1
2
3
4
5
6
7
 4 2 8
1
3
4
2
3
4
1
2
 9 4 9
1
2
3
4
5
6
7
8
9
 7 5 7
1
2
3
4
5
6
7
 15 10 15
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
 4 0 4
1
2
3
4
 12 2 12
1
2
3
4
5
6
7
8
9
10
11
12
 10 2 10
1
2
3
4
5
6
7
8
9
10
 7 4 7
1
2
3
4
5
6
7
 7 3 7
1
2
3
4
5
6
7

XXXXXXX
 ..XX.X.X
 ...X.X.XX
 .X.XXXX
 .X.X.X.X.XXXXXX
 ....
 .........X.X
 .......X.X
 .X.X.XX
 ...X.XX

#include <bits/stdc++.h>
using namespace std;
int n, m, g[111][111], stt, roi[111], res;
void visit(int u, int cha) {
  stt++;
  roi[u] = stt;
  for (int i = 1; i <= n; i++)
    if (g[u][i] == 1 && i != u && i != cha) {
      if (roi[i] > 0 && roi[i] < roi[u]) res++;
      if (roi[i] == 0) visit(i, u);
    };
};
int main() {
  if (0) {
    freopen("aaa.inp", "r", stdin);
    freopen("aaa.out", "w", stdout);
  };
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    g[u][v] = 1;
    g[v][u] = 1;
  };
  res = 0;
  int count = 0;
  for (int i = 1; i <= n; i++)
    if (roi[i] == 0) {
      count++;
      visit(i, 0);
    }
  if (res == 1 && count == 1)
    printf("FHTAGN!");
  else
    printf("NO");
  return 0;
};
