#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
std::vector<int> v[maxn], vr[maxn];
std::vector<int> order, comp;
int vis[maxn], ans[maxn];
long long int col[2];
void dfs(int n, int p, int c) {
  col[c]++;
  for (int ch : v[n])
    if (ch != p) dfs(ch, n, !c);
}
void dfs1(int n) {
  vis[n] = 1;
  comp.push_back(n);
  for (int ch : vr[n]) {
    if (!vis[ch]) dfs1(ch);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int n;
  cin >> n;
  int p[5] = {0};
  while (n--) {
    int a, b;
    cin >> a >> b;
    p[a - 1]++;
    p[b - 1]++;
  }
  int f = 0;
  for (int i = 0; i < 5; i++) {
    if (p[i] != 2) {
      cout << "WIN";
      f = 1;
      return 0;
    }
  }
  if (!f) {
    cout << "FAIL";
  }
}
