#include <iostream>
#include <cstdio>
#include <vector>

#define N 101

using namespace std;

vector <int> g[N];

bool was[N];

void dfs(int v)
{
    was[v] = 1;

    for (int i = 0; i < g[v].size(); i++)
    {
        int u = g[v][i];
        if (!was[u])
            dfs(u);
    }
}


int main()
{
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < m; i++)
    {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    int tmp = 1;

    dfs(1);

    for (int i = 1; i <= n; i++)
    {
        fprintf(stderr,"%d ",was[i]);
        if (!was[i])
            tmp = 0;
    }

    if (n == m && tmp == 1)
        cout << "FHTAGN!";
    else
        cout << "NO";

    return 0;
}