#include <bits/stdc++.h>

using namespace std;

#define LOG(...) fprintf(stderr,__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void dfs(string ss, string& s, int a, int b, set<string>& res) {
    if (abs(a-b) == 1) {
        res.insert(ss);
        return;
    }

    dfs(ss + s[a+1], s, a+1, b, res);
    dfs(ss + s[b-1], s, a, b-1, res);
}

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

    set<string> res;
    string ss;
    dfs(ss, s, -1, s.length(), res);

    cout << res.size() << endl;
}