#ifndef KOMAKI_LOCAL
#define NDEBUG
#endif

#include <bits/stdc++.h>
#include <sys/time.h>
#include <unistd.h>
using namespace std;
#define i64         int64_t
#define rep(i, n)   for(i64 i = 0; i < ((i64)(n)); ++i)
#define sz(v)       ((i64)((v).size()))
#define bit(n)      (((i64)1)<<((i64)(n)))
#define all(v)      (v).begin(), (v).end()

std::string dbgDelim(int &i){ return (i++ == 0 ? "" : ", "); }
#define dbgEmbrace(exp) { int i = 0; os << "{"; { exp; } os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> v);
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> v);
template <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> q);
template <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> q);
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> p);
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> mp);
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> mp);
template <int INDEX, class TUPLE> void dbgDeploy(std::ostream &os, TUPLE tuple){}
template <int INDEX, class TUPLE, class H, class ...Ts> void dbgDeploy(std::ostream &os, TUPLE t)
{ os << (INDEX == 0 ? "" : ", ") << get<INDEX>(t); dbgDeploy<INDEX + 1, TUPLE, Ts...>(os, t); }
template <class T, class K> void dbgDeploy(std::ostream &os, std::pair<T, K> p, std::string delim)
{ os << "(" << p.first << delim << p.second << ")"; }
template <class ...Ts> std::ostream& operator<<(std::ostream &os, std::tuple<Ts...> t)
{ os << "("; dbgDeploy<0, std::tuple<Ts...>, Ts...>(os, t); os << ")"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> p)
{ dbgDeploy(os, p, ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> v)
{ dbgEmbrace( for(T t: v){ os << dbgDelim(i) << t; }); }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> s)
{ dbgEmbrace( for(T t: s){ os << dbgDelim(i) << t; }); }
template <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> q)
{ dbgEmbrace( for(; q.size(); q.pop()){ os << dbgDelim(i) << q.front(); }); }
template <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> q)
{ dbgEmbrace( for(; q.size(); q.pop()){ os << dbgDelim(i) << q.top();   }); }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> mp)
{ dbgEmbrace( for(auto p: mp){ os << dbgDelim(i); dbgDeploy(os, p, "->"); }); }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> mp)
{ dbgEmbrace( for(auto p: mp){ os << dbgDelim(i); dbgDeploy(os, p, "->"); }); }
#define DBG_OUT std::cerr
#define DBG_OVERLOAD(_1, _2, _3, _4, _5, _6, macro_name, ...) macro_name
#define DBG_LINE() { char s[99]; sprintf(s, "line:%3d | ", __LINE__); DBG_OUT << s; }
#define DBG_OUTPUT(v) { DBG_OUT << (#v) << "=" << (v); }
#define DBG1(v, ...) { DBG_OUTPUT(v); }
#define DBG2(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG1(__VA_ARGS__); }
#define DBG3(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG2(__VA_ARGS__); }
#define DBG4(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG3(__VA_ARGS__); }
#define DBG5(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG4(__VA_ARGS__); }
#define DBG6(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG5(__VA_ARGS__); }

#define DEBUG0() { DBG_LINE(); DBG_OUT << std::endl; }
#define DEBUG(...)                                                      \
  {                                                                     \
    DBG_LINE();                                                         \
    DBG_OVERLOAD(__VA_ARGS__, DBG6, DBG5, DBG4, DBG3, DBG2, DBG1)(__VA_ARGS__); \
    DBG_OUT << std::endl;                                               \
  }

bool rev_equal(string &s0, string &s1)
{
  if(sz(s0) != sz(s1)) exit(1);
  rep(i, sz(s0))if(s0[i] != s1[sz(s1) - 1 - i]) return false;
  return true;
}

unordered_map<string, i64> dp;

i64 recur(i64 pos, string s, string blue_top, string blue_last, string red_top, string red_last)
{
  if(0 < sz(blue_top) && 0 < sz(red_top)){
    if(blue_top[0] != red_top[0]) return 0;
    return recur(pos, s, blue_top.substr(1), blue_last, red_top.substr(1), red_last);
  }
  if(0 < sz(blue_last) && 0 < sz(red_last)){
    if(blue_last[0] != red_last[0]) return 0;
    return recur(pos, s, blue_top, blue_last.substr(1), red_top, red_last.substr(1));
  }

  i64 rem = sz(s) - pos * 2;
  if(rem < abs(sz(blue_top) + sz(blue_last) - sz(red_top) - sz(red_last))) return 0;
  if(rem == 0){
    if(!rev_equal(blue_top, red_last)) return 0;
    if(!rev_equal(blue_last, red_top)) return 0;
    return 1;
  }

  string hash(pos, 'a');
  hash += ":";
  hash += blue_top + ":";
  hash += blue_last + ":";
  hash += red_top + ":";
  hash += red_last + ":";
  if(dp.count(hash)) return dp[hash];


  i64 ans = 0;
  char char_l = s[pos];
  char char_r = s[sz(s) - 1 - pos];
  ans += recur(pos + 1, s, blue_top + char_l, blue_last + char_r, red_top, red_last);
  ans += recur(pos + 1, s, blue_top + char_l, blue_last, red_top + char_r, red_last);
  ans += recur(pos + 1, s, blue_top, blue_last + char_r, red_top, red_last + char_l);
  ans += recur(pos + 1, s, blue_top, blue_last, red_top + char_r, red_last + char_l);
  // DEBUG(ans, pos, blue_top, blue_last, red_top, red_last);
  return dp[hash] = ans;
}

int main()
{
  string s;
  cin >> s >> s;
  cout << recur(0, s, "", "", "", "") << endl;
}



Measured memory_bytes: 512