You are given a string $s$ consisting of $n$ lowercase Latin letters. $n$ is even.

For each position $i$ ($1 \le i \le n$) in string $s$ you are required to change the letter on this position either to the previous letter in alphabetic order or to the next one (letters 'a' and 'z' have only one of these options). Letter in every position must be changed exactly once.

For example, letter 'p' should be changed either to 'o' or to 'q', letter 'a' should be changed to 'b' and letter 'z' should be changed to 'y'.

That way string "codeforces", for example, can be changed to "dpedepqbft" ('c' $\rightarrow$ 'd', 'o' $\rightarrow$ 'p', 'd' $\rightarrow$ 'e', 'e' $\rightarrow$ 'd', 'f' $\rightarrow$ 'e', 'o' $\rightarrow$ 'p', 'r' $\rightarrow$ 'q', 'c' $\rightarrow$ 'b', 'e' $\rightarrow$ 'f', 's' $\rightarrow$ 't').

String $s$ is called a palindrome if it reads the same from left to right and from right to left. For example, strings "abba" and "zz" are palindromes and strings "abca" and "zy" are not.

Your goal is to check if it's possible to make string $s$ a palindrome by applying the aforementioned changes to every position. Print "YES" if string $s$ can be transformed to a palindrome and "NO" otherwise.

Each testcase contains several strings, for each of them you are required to solve the problem separately.


-----Input-----

The first line contains a single integer $T$ ($1 \le T \le 50$) — the number of strings in a testcase.

Then $2T$ lines follow — lines $(2i - 1)$ and $2i$ of them describe the $i$-th string. The first line of the pair contains a single integer $n$ ($2 \le n \le 100$, $n$ is even) — the length of the corresponding string. The second line of the pair contains a string $s$, consisting of $n$ lowercase Latin letters.


-----Output-----

Print $T$ lines. The $i$-th line should contain the answer to the $i$-th string of the input. Print "YES" if it's possible to make the $i$-th string a palindrome by applying the aforementioned changes to every position. Print "NO" otherwise.


-----Example-----
Input
5
6
abccba
2
cf
4
adfa
8
abaazaba
2
ml

Output
YES
NO
YES
NO
NO



-----Note-----

The first string of the example can be changed to "bcbbcb", two leftmost letters and two rightmost letters got changed to the next letters, two middle letters got changed to the previous letters.

The second string can be changed to "be", "bg", "de", "dg", but none of these resulting strings are palindromes.

The third string can be changed to "beeb" which is a palindrome.

The fifth string can be changed to "lk", "lm", "nk", "nm", but none of these resulting strings are palindromes. Also note that no letter can remain the same, so you can't obtain strings "ll" or "mm".

Difficulty: interview

Starter code:

Solutions:
def valid(a, b):
    d = abs(ord(a) - ord(b))
    return d == 0 or d == 2

T = int(input())
for _ in range(T):
    n = int(input())
    s = input()
    val = all(valid(s[i], s[n - i - 1]) for i in range(n))
    print('YES' if val else 'NO')


t = int(input())
for i in range(t):
    n = int(input())
    a = input()
    flag = True
    for j in range(n // 2):
        if abs(ord(a[j]) - ord(a[-1-j])) > 2 or abs(ord(a[j]) - ord(a[-1-j])) == 1:
            print("NO")
            break
    else:
        print("YES")

import sys
import os

def solve(s):
    n = len(s)
    for i in range(n // 2):
        a = ord(s[i])
        b = ord(s[n - 1 - i])
        diff = abs(a - b)
        if diff != 0 and abs(diff) != 2:
            return 'NO'
    return 'YES'

def main():
    t = int(input())
    for i in range(t):
        _ = int(input())
        s = input()
        print(solve(s))


def __starting_point():
    main()
__starting_point()

T = int(input())

for t in range(T):
    n = int(input())
    s = list(input())

    ok = True
    for i in range(n // 2):
        d = abs(ord(s[i]) - ord(s[-i - 1]))
        if d > 2 or d == 1:
            ok = False

    print(["NO", "YES"][ok])


USE_STDIO = False

if not USE_STDIO:
    try: import mypc
    except: pass

def check(s):
    i, j = 0, len(s) - 1
    while i < j:
        if abs(ord(s[i]) - ord(s[j])) not in [0, 2]:
            return False
        i, j = i + 1, j - 1
    return True

def main():
    T, = list(map(int, input().split(' ')))
    for _ in range(T):
        n, = list(map(int, input().split(' ')))
        s = input()
        print(['NO', 'YES'][check(s)])


def __starting_point():
    main()




__starting_point()

q = int(input())

for x in range(q):
    n = int(input())

    s = str(input())
    
    f = False
    for x in range(n // 2):
        if abs(ord(s[x]) - ord(s[n - x - 1])) > 2 or abs(ord(s[x]) - ord(s[n - x - 1])) == 1:
               f = True
               break
    if f:
        print("NO")
    else:
        print("YES")
    


def mi():
	return map(int, input().split())

for _ in range(int(input())):
	n = int(input())
	a = list(input())
	flag=  0
	for i in range(n//2):
		c1 = ord(a[i])
		c2 = ord(a[n-1-i])
		if c1-1==c2-1 or c1-1==c2+1 or c1+1==c2-1 or c1+1==c2+1:
			flag = 0
		else:
			flag = 1
			break
	if flag:
		print ('NO')
	else:
		print ('YES')

t = int(input())

for _ in range(t):
    n = int(input())
    s = input()
    ans = True
    for i in range(n // 2):
        if abs(ord(s[i]) - ord(s[n - i - 1])) not in (0, 2):
            ans = False
            break
    print('YES' if ans else 'NO')


def move(c):
    if c == 'a':
        return ['b']
    elif c == 'z':
        return ['y']
    return [chr(ord(c) - 1), chr(ord(c))]
def solve(s):
    l = 0
    r = len(s) - 1
    while l < r:
        d = abs(ord(s[l]) - ord(s[r]))
        if not(d == 0 or d == 2):
            return False
        l += 1
        r -= 1
    return True
n = int(input())
for i in range(n):
    l = input()
    s = input()
    if solve(s):
        print('YES')
    else:
        print('NO')

import sys

T = int(input())

for i in range(T):
    n = int(input())
    s = input()
    l, r = 0, n - 1
    out = False
    while r > l:
        t = abs(ord(s[r]) - ord(s[l]))
        if t != 0 and t != 2:
            print("NO")
            out = True
            break
        l += 1
        r -= 1
    if not out:
        print("YES")

t = int(input())
for j in range(t):
    n = int(input())
    s = input()
    f = True
    for i in range(n // 2):
        c = abs(ord(s[i]) - ord(s[n - i - 1]))
        if c != 0 and c != 2:
            f = False
            break
    if f:
        print('YES')
    else:
        print('NO')

def solve(s, n):
    i = 0
    while i < n//2:
        if s[i] != s[n-i-1]:
            if abs(ord(s[i])-ord(s[n-i-1])) != 2:
                return "NO"
        i += 1
    return "YES"
for _ in range(int(input())):
    n = int(input())
    s = input()
    print(solve(s, n))

from collections import defaultdict
t = int(input())
a = 'abcdefghijklmnopqrstuvwxyz'
changes = defaultdict(set)
changes['a'].add('b')
changes['z'].add('y')
for i in range(1,25):
    o1,o2 = a[i-1],a[i+1]
    changes[a[i]].add(o1)
    changes[a[i]].add(o2)
for _ in range(t):
    n = int(input())
    s = input()
    half = n//2
    for x in range(half):
        left = s[x]
        right = s[n-x-1]
        choice_left = changes[left]
        choice_right = changes[right]
        if not choice_left & choice_right:
            print ('NO')
            break
    else:
        print ('YES')


n = int(input())

for _ in range(n):
    input()
    s = input()

    for i in range(len(s) // 2):
        val = abs(ord(s[i]) - ord(s[-1 - i]))
        if val != 0 and val != 2:
            print('NO')
            break
    else:
        print('YES')


cases=int(input())
for case in range(cases):
    n=int(input())
    s=list(input())
    can=True
    for i in range((n//2)+1):
        if not ((ord(s[i])+1==ord(s[n-1-i])-1) or (ord(s[i])-1==ord(s[n-1-i])+1) or ord(s[i])==ord(s[n-1-i])):
            can=False
            break
    if can:
        print("YES")
    else:
        print("NO")


for _ in range(int(input())):
    n=int(input())
    s=input()
    s2=s[::-1]
    fail=False
    for i in range(len(s)):
        diff=abs(ord(s[i])-ord(s2[i]))
        if diff and diff!=2:
            print('NO')
            fail=True
            break
    if not fail: print('YES')

num_cases = int(input())

for case in range(num_cases):
    n = int(input())
    s = input()
    solution = 'YES'
    for i in range(n // 2):
        d = abs(ord(s[i]) - ord(s[n - i - 1]))
        if not d == 0 and not d == 2:
            solution = 'NO'
            break
    print(solution)

t = int(input())

for _ in range(t):
    n = int(input())
    s = input().strip()

    ok = True

    for i in range(n // 2):
        c1, c2 = s[i], s[n - i - 1]
        if abs(ord(c2) - ord(c1)) not in {0, 2}:
            ok = False
            break

    print(['NO', 'YES'][ok])


nbChaines = int(input())

for i in range(nbChaines):
   nbCaracteres = int(input())
   chaine = input()
   a = True
   
   for j in range(nbCaracteres//2):
      if ord(chaine[j])-1 == ord(chaine[-1-j])+1 or ord(chaine[j])-1 == ord(chaine[-1-j])-1\
          or ord(chaine[j])+1== ord(chaine[-1-j])-1 or ord(chaine[j])+1== ord(chaine[-1-j])+1:
         pass
      else:
         a = False
   if a:
      print("YES")
   else:
      print("NO")


def getV(c):
    if (c == 'a'):
        return ['b']
    if (c == 'z'):
        return ['y']
    return [chr(ord(c) + 1), chr(ord(c) - 1)]

T = int(input().strip())

for i in range(T):
    n = int(input().strip())
    s = input().strip()
    for j in range(n//2):
        first = getV(s[j])
        second = getV(s[n-j-1])
        b = False
        for c in second:
            if c in first:
                b = True
                break
        if not (b):
            print('NO')
            break
    else:
        print('YES')


t = int(input())
for i in range(t):
    n = int(input())
    s = list(input())
    for i in range(n):
        s[i] = ord(s[i]) - 97
    ok = True
    for i in range(n // 2):
        if s[i] == s[-i - 1]:
            continue
        if s[i] == s[-i - 1] - 2 and s[-i - 1] > 1:
            continue
        if s[i] == s[-i - 1] + 2:
            continue
        print('NO')
        ok = False
        break
    if ok:
        print('YES')
    


t=int(input())
for i in range(t):
    n=int(input())
    s=input()
    k=[0,2]
    flag=0
    for i in range(0,n//2):
        if abs(ord(s[i])-ord(s[n-i-1])) not in k: 
            flag=1
    if flag==0:
        print("YES")
    else:
        print("NO")

import sys

input = sys.stdin.readline

t = int(input())

for zzz in range(t):
    l = int(input())
    s = input().strip()
    good = True
    for i in range(l):
        j = l-i-1
        diff = abs(ord(s[i]) - ord(s[j]))
        if (diff == 1 or diff > 2):
            good = False
            break
    if good:
        print('YES')
    else:
        print('NO')


l ={'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, 'j': 10, 'k': 11, 'l': 12, 'm': 13, 'n': 14, 'o': 15, 'p': 16, 'q': 17, 'r': 18, 's': 19, 't': 20, 'u': 21, 'v': 22, 'w': 23, 'x': 24, 'y': 25, 'z': 26}
for i in range(int(input())):
    n = int(input())
    s = input()
    if(s==s[::-1]):
        print('YES')
    else:
        f = 1
        for i in range(n//2):
            if(abs(l[s[i]]-l[s[n-i-1]])!=2 and abs(l[s[i]]-l[s[n-i-1]])!=0):
                f = 0
        if(f):
            print('YES')
        else:
            print('NO')