func_code_string: #include <bits/stdc++.h>   using namespace std;   vector<vector<int> > g(7);   vector<int> vis(7);   int cycles = 0;   int nds = 0;   bool allvis() {     for (int i = 1; i <= 5; i++)       if (!vis[i]) return false;     return true;   }   bool dfs(int node, int par, int cnt) {     if (vis[node]) {       cycles++;       nds = cnt;       return true;     }     vis[node] = 1;     for (int i = 0; i < g[node].size(); i++) {       int child = g[node][i];       if (child != par) {         if (dfs(child, node, cnt + 1)) return true;       }     }     return false;   }   int main() {     int m;     while (cin >> m) {       g.clear();       g.resize(7);       vis.clear();       vis.resize(7);       cycles = 0;       nds = 0;       int a, b;       for (int i = 0; i < m; i++) {         cin >> a >> b;         g[a].push_back(b);         g[b].push_back(a);       }       int tmp = 0;       for (int i = 1; i <= 5; i++) {         if (g[i].size() < 2) tmp++;       }       dfs(1, 0, 0);       if (cycles == 1 && nds == 5 && m == 5)         cout <<  FAIL  << endl;       else         cout <<  WIN  << endl;     }     return 0;   }   