#include <bits/stdc++.h>
using namespace std;
using namespace std;
long long pow_m(long long x, long long y, long long m = 1000000007) {
  x = x % m;
  long long res = 1;
  while (y) {
    if (y & 1) res = res * x;
    res %= m;
    y = y >> 1;
    x = x * x;
    x %= m;
  }
  return res;
}
long long modInverse(long long a, long long m) { return pow_m(a, m - 2, m); }
long long bin_coff(long long n, long long k, long long m) {
  vector<vector<long long>> ans(n + 1, vector<long long>(k, 0));
  for (long long i = 0; i < n + 1; i++) {
    for (long long j = 0; j < min(i, k) + 1; j++) {
      if (j == 0 || j == i)
        ans[i][j] = 1;
      else
        ans[i][j] = ans[i - 1][j - 1] % m + ans[i - 1][j] % m;
    }
  }
  return ans[n][k] % m;
}
long long inverse(long long i) {
  if (i == 1) return 1;
  return (1000000007 -
          ((1000000007 / i) * inverse(1000000007 % i)) % 1000000007 +
          1000000007) %
         1000000007;
}
const long long N = 10000007;
vector<bool> primes(N + 1, true);
void eren() {
  primes[0] = false;
  primes[1] = false;
  for (long long i = 2; i * i <= N; i++) {
    if (primes[i]) {
      for (long long j = i * i; j <= N; j += i) primes[j] = false;
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  eren();
  int tt = 1;
  for (int it = 0; it < tt; it++) {
    long long n;
    cin >> n;
    long long x, y;
    bool vis[5][5];
    for (long long i = 0; i < 5; i++) {
      for (long long j = 0; j < 5; j++) vis[i][j] = false;
    }
    for (long long i = 0; i < n; i++) {
      cin >> x >> y;
      x--;
      y--;
      vis[x][y] = true;
      vis[y][x] = true;
    }
    for (long long i = 0; i < 3; i++) {
      for (long long j = i + 1; j < 4; j++) {
        for (long long k = j + 1; k < 5; k++) {
          if (vis[i][j] == vis[i][k] && vis[i][k] == vis[j][k]) {
            cout << "WIN\n";
            return 0;
          }
        }
      }
    }
    cout << "FAIL\n";
  }
  return 0;
}
