#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
template <typename T>
bool mycomp(T x, T y) {
  return (x == y);
}
bool paircomp(const pair<long long int, long long int> &x,
              const pair<long long int, long long int> &y) {
  return x.second < y.second;
}
long long int f[6][6];
void solve() {
  long long int m;
  cin >> m;
  for (long long int i = 0; i < m; i++) {
    long long int x, y;
    cin >> x >> y;
    f[x][y] = 1;
    f[y][x] = 1;
  }
  for (long long int i = 1; i <= 5; i++) {
    for (long long int j = i + 1; j <= 5; j++) {
      for (long long int k = j + 1; k <= 5; k++) {
        if (f[i][j] && f[i][k] && f[j][k]) {
          cout << "WIN";
          return;
        }
        if (!f[i][j] && !f[i][k] && !f[j][k]) {
          cout << "WIN\n";
          return;
        }
      }
    }
  }
  cout << "FAIL";
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    solve();
    cout << endl;
  }
}
