#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

inline bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }

typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef long long ll;
typedef unsigned long long ull;

#define For(i,a,b)	for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int mod = 1000000007;
const int INF = 1e9;


bool ok(string &s){
	rep(i, s.size() / 2){
		int t = s.size() - 1 - i;
		if (s[i] != s[t]){
			if (s[i] == '?'){ s[i] = s[t]; continue; }
			if (s[t] == '?'){ s[t] = s[i]; continue; }
			return false;
		}
	}
	return true;
}
bool ok2(string &s, int i){
	int t = s.size() - 1 - i;
	if (s[i] == s[t]){
		s[i + 1] = s[t - 1];
		return true;
	}
	return false;
}

int main()
{
	string s;
	cin >> s;

	rep(j, 2){
		rep(i, s.size() / 2){
			string t = s.substr(0, i) + "?" + s.substr(i);
			if ((!i && ok(t)) || (i && ok2(t, i - 1))){
				if (j)reverse(t.begin(), t.end());
				cout << t << endl; return 0;
			}
		}
		reverse(s.begin(), s.end());
	}
	cout << "NA" << endl;

	return 0;
}