#include <bits/stdc++.h>
using namespace std;
vector<int> adj[105];
bool visited[105];
int df[1005];
int ans = 0, k = 0;
void dfs(int i, int parent) {
  visited[i] = true;
  for (int j = 0; j < adj[i].size(); j++) {
    if (!visited[adj[i][j]]) dfs(adj[i][j], i);
  }
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) {
    if (!visited[i]) k++, dfs(i, 0);
  }
  if (n == m && k == 1)
    cout << "FHTAGN!\n";
  else
    cout << "NO\n";
}
