#include <bits/stdc++.h>
using namespace std;
int dfs(int n, vector<vector<int>> &gr, vector<int> &gold, bool vis[],
        int &ans) {
  vis[n] = true;
  ans = min(ans, gold[n]);
  for (int i = 0; i < gr[n].size(); i++) {
    if (!vis[gr[n][i]]) {
      dfs(gr[n][i], gr, gold, vis, ans);
    }
  }
  return ans;
}
int main() {
  int n, m;
  cin >> n;
  vector<vector<int>> v(6);
  while (n--) {
    int a, b;
    cin >> a >> b;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  int flag = 0;
  for (int i = 1; i < v.size(); i++) {
    if (v[i].size() >= 3 || v[i].size() <= 1) {
      flag = 1;
    }
  }
  if (flag == 1)
    cout << "WIN";
  else
    cout << "FAIL";
}
