Mr. Kitayuta has kindly given you a string s consisting of lowercase English letters. You are asked to insert exactly one lowercase English letter into s to make it a palindrome. A palindrome is a string that reads the same forward and backward. For example, "noon", "testset" and "a" are all palindromes, while "test" and "kitayuta" are not.

You can choose any lowercase English letter, and insert it to any position of s, possibly to the beginning or the end of s. You have to insert a letter even if the given string is already a palindrome.

If it is possible to insert one lowercase English letter into s so that the resulting string will be a palindrome, print the string after the insertion. Otherwise, print "NA" (without quotes, case-sensitive). In case there is more than one palindrome that can be obtained, you are allowed to print any of them.

Input

The only line of the input contains a string s (1 ≤ |s| ≤ 10). Each character in s is a lowercase English letter.

Output

If it is possible to turn s into a palindrome by inserting one lowercase English letter, print the resulting string in a single line. Otherwise, print "NA" (without quotes, case-sensitive). In case there is more than one solution, any of them will be accepted. 

Examples

Input

revive


Output

reviver


Input

ee


Output

eye

Input

kitayuta


Output

NA

Note

For the first sample, insert 'r' to the end of "revive" to obtain a palindrome "reviver".

For the second sample, there is more than one solution. For example, "eve" will also be accepted.

For the third sample, it is not possible to turn "kitayuta" into a palindrome by just inserting one letter.
		import java.io.PrintWriter;
	import java.util.Arrays;
	import java.util.HashMap;
	import java.util.Scanner;
		
		
		/*07:05:45PM
		
		String x =sc.next();
		char inp [] = x.toCharArray();
			SimpleDateFormat displayFormat = new SimpleDateFormat("HH:mm");
			SimpleDateFormat parseFormat = new SimpleDateFormat("hh:mm a");
			Date date = parseFormat.parse(x.substring(0, 5)+" "+x.substring(8, 10));
			System.out.println(displayFormat.format(date)+":"+x.substring(6, 8));
		*/
		
		
		
		
		
		
		
		
		public class Main {
		public static long l=10000000000L;
		public static boolean isPal(String x )
		{
			StringBuilder s = new StringBuilder(x).reverse();
			return (s.toString().equals(x));
		}
			public static void main(String[] args) throws Exception {
				PrintWriter out = new PrintWriter(System.out);	
				StringBuilder sb = new StringBuilder();
				Scanner sc = new Scanner(System.in);
				String a  = sc.next();
				for (int i = 0; i < a.length()+1; i++) {
					for (int j = 0; j < 26; j++) {
						String temp = a.substring(0, i)+(char)(j+'a')+a.substring(i);
						if(isPal(temp)){System.out.println(temp);return ;}
					}
				}
				System.out.println("NA");
			}
		}
		
		
		
		
		
		
		
		
		class Pair implements Comparable<Pair>
		{
			public int  x  ,y ,z ;
			Pair(int a , int b , int l)
			{
				x=a;y=b;z=l;
			}
			@Override
			public boolean equals(Object obj) {
				// TODO Auto-generated method stub
				return x==((Pair)(obj)).x && y==((Pair)obj).y;
			}
			
			@Override
			public int hashCode() {
				// TODO Auto-generated method stub
				return 6*x +8*y;
			}
			@Override
			public int compareTo(Pair o) {
				// TODO Auto-generated method stub
				return x*o.y - y*o.x;
			}
			
			
		}
		/*
		 class Scanner 
		{
			StringTokenizer st;
			BufferedReader br;
		
			public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}
		
			public String next() throws IOException 
			{
				while (st == null || !st.hasMoreTokens()) 
					st = new StringTokenizer(br.readLine());
				return st.nextToken();
			}
		
			public int nextInt() throws IOException {return Integer.parseInt(next());}
			
			public long nextLong() throws IOException {return Long.parseLong(next());}
		
			public String nextLine() throws IOException {return br.readLine();}
			
			public double nextDouble() throws IOException
			{
				String x = next();
				StringBuilder sb = new StringBuilder("0");
				double res = 0, f = 1;
				boolean dec = false, neg = false;
				int start = 0;
				if(x.charAt(0) == '-')
				{
					neg = true;
					start++;
				}
				for(int i = start; i < x.length(); i++)
					if(x.charAt(i) == '.')
					{
						res = Long.parseLong(sb.toString());
						sb = new StringBuilder("0");
						dec = true;
					}
					else
					{
						sb.append(x.charAt(i));
						if(dec)
							f *= 10;
					}
				res += Long.parseLong(sb.toString()) / f;
				return res * (neg?-1:1);
			}
			
			public boolean ready() throws IOException {return br.ready();}
		
		
		}
	*/