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|
tc=int(raw_input())
for case in range(tc):
	s=raw_input()
	r=s[::-1]
	l=len(s)
	flag=1
	for i in range(l-1):
		t=ord(s[i])-ord(s[i+1])
		if t>0:
			a=t
		else:
			a=-1*t
		t=ord(r[i])-ord(r[i+1])
		if t>0:
			b=t
		else:
			b=-1*t
		if not a==b:
			flag=0
			break
	if flag==1:
		print "Funny"
	else:
		print "Not Funny"