#include <bits/stdc++.h>
using namespace std;
int fact(int n) {
  int res = 1;
  for (int i = 2; i <= n; i++) res = res * i;
  return res;
}
int nCr(int n, int r) { return fact(n) / (fact(r) * fact(n - r)); }
int cel(int a, int b) { return ((a - 1) / b + 1); }
int gcd(int a, int b) {
  if (a < b) swap(a, b);
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
void dfs(int u, vector<int> &visited, vector<int> adj[]) {
  visited[u] = 1;
  for (int i = 0; i < adj[u].size(); i++)
    if (visited[adj[u][i]] == 0) dfs(adj[u][i], visited, adj);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, t, x, y, c, f;
  cin >> n;
  int A[5][5];
  for (int i = 0; i < 5; i++) {
    for (int j = 0; j < 5; j++) {
      if (i == j) {
        A[i][j] = -1;
      } else
        A[i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    cin >> x >> y;
    A[x - 1][y - 1] = 1;
    A[y - 1][x - 1] = 1;
  }
  t = 0;
  f = 0;
  for (int i = 0; i < 3; i++) {
    for (int j = i + 1; j < 4; j++) {
      for (int k = j + 1; k < 5; k++) {
        if (A[i][j] == 1 && (A[j][k] == 1) && (A[k][i] == 1)) {
          f = 1;
        } else if (A[i][j] == 0 && (A[j][k] == 0) && (A[k][i] == 0)) {
          f = 1;
        }
      }
    }
  }
  if (f)
    cout << "WIN";
  else
    cout << "FAIL";
  return 0;
}
