#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1164777216")
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
const double pi = acos(-1.0), eps = 1e-15;
const int INF = 1000 * 1000 * 1000 + 5, MAXN = 100005, MOD = 1000007;
const long long INFL = 1000000000000000005;
void prepare(string s) {
  if ((int)s.size() != 0) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
  }
}
int n, a, b;
bool used[15][15];
void solve() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a >> b;
    used[a][b] = used[b][a] = true;
  }
  for (int i = 1; i <= 5; i++)
    for (int j = 1; j <= 5; j++)
      for (int k = 1; k <= 5; k++)
        if (i != j && i != k && j != k) {
          if (used[i][j] && used[j][k] && used[i][k] ||
              !used[i][j] && !used[j][k] && !used[i][k]) {
            printf("WIN");
            return;
          }
        }
  printf("FAIL");
}
int main() {
  prepare("");
  srand(time(NULL));
  solve();
  return 0;
}
