Problem: Suppose you have a string S which has length N and is indexed from 0 to N−1. String R is the reverse of the string S. The string S is funny if the condition |Si−Si−1|=|Ri−Ri−1| is true for every i from 1 to N−1.

(Note: Given a string str, stri denotes the ascii value of the ith character (0-indexed) of str. |x| denotes the absolute value of an integer x)

SAMPLE INPUT
2
acxz
bcxz

SAMPLE OUTPUT
Funny
Not Funny

Explanation

Consider the 1st testcase acxz :

c-a
=
x-z
= 2

z-x
=
a-c
= 2

Consider the 2st testcase bcxz

|c-b| != |x-z|

Solution (in PYTHON):

Solution:
#he_play_with_strings.py

import string
d = {}

for i in string.ascii_lowercase:
	d[i] = ord(i)

for i in range(input()):
	flag = 0
	word = raw_input()
	rword = word[::-1]
	for i in xrange(1,len(word)):
		if abs(d[word[i]] - d[word[i-1]]) != abs(d[rword[i]]-d[rword[i-1]]):
			flag = 1
			break
	if flag:
		print "Not Funny"
	else:
		print "Funny"