#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
bool a[6][6];
int main() {
  int m;
  scanf("%d", &m);
  for (int i = 0; i < m; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    a[x][y] = a[y][x] = 1;
  }
  for (int i = 1; i <= 5; i++)
    for (int j = 1; j < i; j++)
      for (int k = 1; k < j; k++)
        if (a[i][j] && a[i][k] && a[j][k] ||
            (!a[i][j] && !a[i][k] && !a[j][k])) {
          printf("WIN\n");
          exit(0);
        }
  printf("FAIL\n");
  return 0;
}
