#include <bits/stdc++.h>
using namespace std;
inline long long pw(long long a, long long b) {
  return (b) ? (pw((a) * (a), (b) >> 1) * ((b)&1 ? (a) : 1)) : 1;
}
const int MAXN = 1e1 + 5;
const long long INF = 1e10;
const long long MOD = 1e9 + 7;
bool rel[5][5];
int main() {
  int n, x, y;
  cin >> n;
  for (int i = 0; i < n; i++)
    cin >> x >> y, rel[x - 1][y - 1] = 1, rel[y - 1][x - 1] = 1;
  for (int i = 0; i < 5; i++)
    for (int j = i + 1; j < 5; j++)
      for (int k = j + 1; k < 5; k++)
        if (rel[i][j] == rel[i][k] && rel[j][k] == rel[i][k])
          return cout << "WIN", 0;
  cout << "FAIL";
}
