#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 2e6 + 13, M = N;
long long n, m, k, v, u, w, c, q, qVal;
int dx[] = {0, 0, -1, 1};
int dy[] = {-1, 1, 0, 0};
int graph[10][10] = {{0}};
void solve(int t) {
  cin >> m;
  for (int i = 0; i < m; i++) {
    cin >> u >> v;
    graph[u][v] = 1;
    graph[v][u] = 1;
  }
  for (int i = 1; i < 6; i++) {
    for (int j = 1; j < 6; j++) {
      if (i == j) continue;
      for (int k = 1; k < 6; k++) {
        if (i == k) continue;
        if (j == k) continue;
        if ((graph[i][j] == 1 && graph[j][k] == 1 && graph[k][i] == 1) ||
            (graph[i][j] == 0 && graph[j][k] == 0 && graph[k][i] == 0)) {
          cout << "WIN\n";
          return;
        }
      }
    }
  }
  cout << "FAIL\n";
}
int main() {
  int t = 1, testCase = 1;
  solve(testCase);
  return 0;
}
