#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
long long int bin_pow(long long int a, long long int b) {
  long long int ans = 1;
  while (b) {
    if (b & 1) {
      ans = (ans * a);
    }
    b >>= 1;
    a = (a * a);
  }
  return ans;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
inline bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.first != b.first) {
    return a.first > b.first;
  }
  return a.second < b.second;
}
long long int solve() {
  vector<int> v[5];
  int m;
  cin >> m;
  for (long long i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    v[x - 1].push_back(y);
    v[y - 1].push_back(x);
  }
  int cnt = 0;
  vector<int> vec;
  for (long long i = 0; i < 5; i++) {
    vec.push_back(int((v[i]).size()));
  }
  sort(vec.begin(), vec.end());
  if (vec[int((vec).size()) - 1] >= 3 || vec[0] <= 1) {
    cout << "WIN";
  } else {
    cout << "FAIL";
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
