#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e4 + 5;
const double EPS = 1e-16;
const long long INF = 1000000000 + 5;
const int MAXN2 = 2e5 + 5;
int g[10][10];
int main() {
  int m;
  scanf("%d", &m);
  int u, v;
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &u, &v);
    g[u][v] = g[v][u] = 1;
  }
  bool good = false;
  for (int i = 1; i < 6; i++) {
    for (int j = i + 1; j < 6; j++) {
      for (int h = j + 1; h < 6; h++) {
        if (g[i][j] && g[i][h] && g[j][h]) {
          good = true;
        }
        if (!g[i][j] && !g[i][h] && !g[j][h]) {
          good = true;
        }
      }
    }
  }
  if (good) {
    printf("WIN");
  } else {
    printf("FAIL");
  }
  return 0;
}
