#include <bits/stdc++.h>
int main() {
  int n, i, j, k, x = 0, y = 0;
  int m[5][5];
  for (i = 0; i < 5; i++) {
    for (j = 0; j < 5; j++) {
      m[i][j] = 0;
    }
  }
  scanf("%d", &n);
  while (n > 0) {
    scanf("%d %d", &x, &y);
    m[x - 1][y - 1] = 1;
    m[y - 1][x - 1] = 1;
    n--;
  }
  for (i = 0; i < 5; i++) {
    for (j = i + 1; j < 5; j++) {
      for (k = j + 1; k < 5; k++) {
        if (m[i][j] == m[j][k] && m[i][j] == m[i][k]) {
          printf("WIN\n");
          exit(0);
        }
      }
    }
  }
  printf("FAIL\n");
  return 0;
}
