#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
bool mat[5][5];
void solve() {
  long long n, m, i, j, k, l, r, p, x, y, z, a, b, c;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a >> b;
    mat[--a][--b] = 1;
    mat[b][a] = 1;
  }
  for (i = 0; i < 5; i++) {
    for (j = i + 1; j < 5; j++) {
      for (k = j + 1; k < 5; k++) {
        if ((mat[i][j] && mat[i][k] && mat[k][j]) ||
            !(mat[i][j] || mat[i][k] || mat[j][k])) {
          cout << "WIN"
               << "\n";
          return;
        }
      }
    }
  }
  cout << "FAIL"
       << "\n";
}
int main() {
  int t;
  solve();
}
