2184-Friends ZCMU_ne day igor k. stopped programming and took up mat-优快云博客

针对数学猜想，即在任意六人中必有三人互识或三人互不识的问题，本篇通过编程验证这一猜想是否同样适用于五人的情况。输入五人间的相识关系，并判断是否存在三人群体完全相识或完全不相识。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

One day Igor K. stopped programming and took up math. One late autumn evening he was sitting at a table reading a book and thinking about something.

The following statement caught his attention: "Among any six people there are either three pairwise acquainted people or three pairwise unacquainted people"

Igor just couldn't get why the required minimum is 6 people. "Well, that's the same for five people, too!" − he kept on repeating in his mind. − "Let's take, say, Max, Ilya, Vova − here, they all know each other! And now let's add Dima and Oleg to Vova − none of them is acquainted with each other! Now, that math is just rubbish!"

Igor K. took 5 friends of his and wrote down who of them is friends with whom. Now he wants to check whether it is true for the five people that among them there are either three pairwise acquainted or three pairwise not acquainted people.

Input

The first line contains an integer m (0≤m≤10), which is the number of relations of acquaintances among the five friends of Igor's.

Each of the following m lines contains two integers ai and bi (1≤ai,bi≤5;ai≠bi), where (ai,bi) is a pair of acquainted people. It is guaranteed that each pair of the acquaintances is described exactly once. The acquaintance relation is symmetrical, i.e. if x is acquainted with y, then y is also acquainted with x.

Output

Print "FAIL", if among those five people there are no either three pairwise acquainted or three pairwise unacquainted people. Otherwise print "WIN。

Examples

Input

Output

WIN

Input

Output

FAIL

思路:5个朋友中要有3对人是互相认识，3对人是互相不认识。但若是5个人的关系之中存在环，那么这个情况便不符合要求

代码：

#include<stdio.h>
#include<string.h>
int re[10];
int main()
{
    int n,i,x,y,flag;
    while(~scanf("%d",&n))
    {
        memset(re,0,sizeof(re));
        for(i=0;i<n;i++)
        {
           scanf("%d%d",&x,&y);
           re[x]++;
           re[y]++;
        }
        flag=0;
        for(i=1;i<=5;i++)
        {
            if(re[i]!=2)
               flag=1;
        }
        if(flag)
            printf("WIN\n");
        else
            printf("FALL\n");
    }
    return 0;
}