#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > a(10, vector<int>());
bool vis[10];
bool dfs(int node) {
  vis[node] = true;
  for (int i = 0; i < a[node].size(); i++)
    if (!vis[a[node][i]]) dfs(a[node][i]);
}
int main() {
  bool WIN = false;
  int m, x, y, c = 0;
  cin >> m;
  while (m--) {
    cin >> x >> y;
    a[x].push_back(y);
    a[y].push_back(x);
  }
  for (int i = 1; i <= 5; i++)
    if (a[i].size() >= 3) WIN = true;
  if (WIN) {
    cout << "WIN" << endl;
    return 0;
  } else {
    for (int i = 1; i <= 5; i++)
      if (!vis[i]) c++, dfs(i);
  }
  for (int i = 1; i <= 5; i++) {
    if (5 - (a[i].size() + 1) >= 3) {
      cout << "WIN" << endl;
      return 0;
    }
  }
  cout << "FAIL" << endl;
  return 0;
}
