#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

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

    string t = s;
    reverse(t.begin(), t.end());

    vector<int> diff(s.length() + 1);

    rep (i, s.length()) {
        diff[i] = s[i] - t[i];
    }

    int pos = 0;

    rep (i, s.length()) {
        if (diff[i] != 0) {
            pos = i;
            break;
        }
    }

    t += "~";

    for (int i = t.length(); i > pos; i--) {
        t[i] = t[i - 1];
    }

    rep (i, s.length()) {
        diff[i] = s[i] - t[i];
    }

    t[pos] = t[t.length() - pos - 1];

    bool all = true;

    rep (i, t.length()) {
        if (t[i] != t[t.length() - i - 1]) {
            all = false;
        }
    }

    if (all) {
        cout << t << endl;
    } else {
        cout << "NA" << endl;
    }
}