1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include <bits/stdc++.h>
#include "palindromy.h"
#include "message.h"
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',')cerr<<*sdbg++; cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }


struct Manacher {
  // IGNORES FIRST LETTER - in[0] must be space
  // par[i] = k <=> [i - k + 1, i + k] is maximal palindrome
  // npar[i] = k <=> [i - k, i + k] is maximal palindrome
  vector<int> par, npar;
  Manacher(string in) {
    assert(in[0] == ' ');
    int orig_n = SZ(in) - 1;
    string s = " #";
    for (int i = 1; i <= orig_n; i++) {
      s += in[i];
      s += '#';
    }
    s += '$';
    int new_n = SZ(s) - 2;
    npar.resize(new_n + 2);
    int furth_beg = 0;
    int furth_end = 0;
    for (int i = 1; i <= new_n; i++) {
      if (furth_end < i) {
        furth_beg = i;
        furth_end = i;
      }
      int corr_npar = furth_beg + furth_end - i;
      if (furth_end > i + npar[corr_npar]) {
        npar[i] = npar[corr_npar];
      } else {
        npar[i] = furth_end - i;
        furth_beg = i - npar[i];
        while (s[furth_beg - 1] == s[furth_end + 1]) {
          furth_beg--;
          furth_end++;
          npar[i]++;
        }
      }
    }
    par.resize(orig_n + 2);
    for (int i = 1; i <= orig_n; i++) {
      if (i < orig_n) {
        par[i] = npar[2 * i + 1] / 2;
      }
      npar[i] = npar[2 * i] / 2;
    }
    npar.resize(orig_n + 2);
  }
};

int n, inst_num, id;
int32_t main() {
  n = GetLength();
  inst_num = min((int)NumberOfNodes(), n);
  id = MyNodeId();
  if (id) { return 0; }
  string s = " ";
  REP (i, n) {
    s.PB(GetLetter(i));
  }
  
  Manacher man(s);
  int ans = 0;
  RE (i, n) {
    ans += man.par[i];
    ans += man.npar[i] + 1;
  }
  cout<<ans<<endl;
  
  return 0;
}