#include <bits/stdc++.h>
using namespace std;
static const double EPS = 1e-6;
const long double pi = acos(-1.0);
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1, 0},
    dy[] = {1, 0, -1, 0, 1, -1, 1, -1, 0};
int aq[5][5];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < (int)(n); ++i) {
    int x, y;
    cin >> x >> y;
    aq[x - 1][y - 1] = aq[y - 1][x - 1] = 1;
  }
  int ap = 0, nap = 0;
  for (int i = 0; i < (int)(5); ++i)
    for (int j = 0; j < (int)(i); ++j)
      for (int k = 0; k < (int)(j); ++k) {
        if (aq[i][j] && aq[j][k] && aq[k][i]) ap = 1;
        if (!aq[i][j] && !aq[j][k] && !aq[k][i]) nap = 1;
      }
  if (ap || nap)
    cout << "WIN" << endl;
  else
    cout << "FAIL" << endl;
}
