#include <bits/stdc++.h>
using namespace std;
int m;
bool M[5][5];
vector<int> adj1[5];
vector<int> adj2[5];
void caso() {
  memset(M, 0, sizeof(M));
  for (int i = 0; i < 5; ++i) adj1[i].clear(), adj2[i].clear();
  for (int i = 0; i < m; ++i) {
    int x, y;
    cin >> x >> y;
    x--, y--;
    M[x][y] = 1;
    M[y][x] = 1;
  }
  for (int i = 0; i < 5; ++i)
    for (int j = i + 1; j < 5; j++)
      if (M[i][j] == 1) {
        adj1[i].push_back(j);
        adj1[j].push_back(i);
      } else {
        adj2[i].push_back(j);
        adj2[j].push_back(i);
      }
  for (int i = 0; i < 5; ++i) {
    int n = adj1[i].size();
    for (int j = 0; j < n; ++j)
      for (int k = j + 1; k < n; ++k) {
        int a = adj1[i][j];
        int b = adj1[i][k];
        if (M[a][b]) {
          cout << "WIN\n";
          return;
        }
      }
  }
  for (int i = 0; i < 5; ++i) {
    int n = adj2[i].size();
    for (int j = 0; j < n; ++j)
      for (int k = j + 1; k < n; ++k) {
        int a = adj2[i][j];
        int b = adj2[i][k];
        if (!M[a][b]) {
          cout << "WIN\n";
          return;
        }
      }
  }
  cout << "FAIL\n";
}
int main() {
  while (cin >> m) caso();
}
