beecrowd | 3003

# The Little Group

By Samuel Eduardo da Silva, IFSULDEMINAS/UFF Brazil

Timelimit: 1

Hitchcock loves parties, and always likes to call his friends to enjoy. But he has a very strange restriction on parties (really VERY strange). For him to go, he must first know the people who go and his relations of friendship and, to be a party of his taste, at least three people have to know each other or not know each other. He is very excited about buying college athletic items and asked you, a great programmer, that given the list of friendships that people go to the next party, whether it's a good party or not, in relation to your personal taste .

## Input

The first line of the entry contains two integers, N (3 ≤ N ≤ 105) and M (0 ≤ M ≤ ((N-1)*N))/2), indicating the number of party participants and the number of friendships. The next M lines contain the friendship relations, which are given by two integers A and B (1 ≤ A,B N), indicating that person A befriends person B, and vice versa.

## Output

Contains one of the following messages:

● “Festa bunita, festa formosa.”, if it is a party to please Hitchcock.

● “Role torto.” If the party is not to Hitchcock's liking.

 Input Samples Output Samples 5 5 1 3 4 1 2 5 2 4 5 3 Role torto.
 6 6 1 3 6 2 4 3 1 6 5 1 6 4 Festa bunita, festa formosa.