#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
long long int pw(long long int a, long long int b) {
  long long int r = 1;
  for (long long int i = 0; i < b; i++) {
    r = ((r % 1000000007) * (a % 1000000007)) % 1000000007;
  }
  return r;
}
long long int power(long long int x, unsigned long long int y,
                    long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve() {
  int m;
  cin >> m;
  std::vector<int> v[6];
  for (long long int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    v[a].push_back(b);
    ;
    v[b].push_back(a);
    ;
  }
  for (long long int i = 1; i < 4; i++) {
    for (long long int j = i + 1; j < 5; j++) {
      for (long long int k = j + 1; k < 6; k++) {
        if ((find(v[i].begin(), v[i].end(), j) != v[i].end() &&
             find(v[i].begin(), v[i].end(), k) != v[i].end() &&
             find(v[k].begin(), v[k].end(), j) != v[k].end()) ||
            (!(find(v[i].begin(), v[i].end(), j) != v[i].end()) &&
             (!(find(v[i].begin(), v[i].end(), k) != v[i].end())) &&
             (!(find(v[k].begin(), v[k].end(), j) != v[k].end())))) {
          cout << "WIN";
          return;
        }
      }
    }
  }
  cout << "FAIL";
}
signed main() {
  ios_base::sync_with_stdio(false);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}
